./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 fca748b1 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-wip.dd.update-z3-fca748b-m [2024-11-19 20:48:44,703 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 20:48:44,748 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 20:48:44,752 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 20:48:44,753 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 20:48:44,779 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 20:48:44,780 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 20:48:44,780 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 20:48:44,780 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 20:48:44,781 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 20:48:44,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 20:48:44,785 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 20:48:44,786 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 20:48:44,786 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 20:48:44,786 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 20:48:44,787 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 20:48:44,787 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 20:48:44,787 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 20:48:44,787 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 20:48:44,787 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 20:48:44,788 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 20:48:44,788 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 20:48:44,788 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 20:48:44,789 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 20:48:44,789 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 20:48:44,789 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 20:48:44,789 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 20:48:44,789 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 20:48:44,790 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 20:48:44,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 20:48:44,790 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 20:48:44,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 20:48:44,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 20:48:44,791 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 20:48:44,791 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 20:48:44,791 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 20:48:44,791 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 20:48:44,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 20:48:44,792 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 20:48:44,792 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 20:48:44,792 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 20:48:44,793 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 20:48:44,793 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-11-19 20:48:44,986 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 20:48:45,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 20:48:45,004 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 20:48:45,005 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 20:48:45,005 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 20:48:45,006 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2024-11-19 20:48:46,360 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 20:48:46,677 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 20:48:46,678 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2024-11-19 20:48:46,696 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecf0c2e51/8e8cbff813f344d2a089c6f5b4af7f40/FLAG0a849ed6b [2024-11-19 20:48:46,722 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecf0c2e51/8e8cbff813f344d2a089c6f5b4af7f40 [2024-11-19 20:48:46,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 20:48:46,725 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 20:48:46,727 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 20:48:46,727 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 20:48:46,732 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 20:48:46,732 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:48:46" (1/1) ... [2024-11-19 20:48:46,734 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@701f6ced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:48:46, skipping insertion in model container [2024-11-19 20:48:46,735 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:48:46" (1/1) ... [2024-11-19 20:48:46,804 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 20:48:47,302 WARN L250 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-11-19 20:48:47,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 20:48:47,363 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 20:48:47,469 WARN L250 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-11-19 20:48:47,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 20:48:47,513 INFO L204 MainTranslator]: Completed translation [2024-11-19 20:48:47,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:48:47 WrapperNode [2024-11-19 20:48:47,519 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 20:48:47,520 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 20:48:47,521 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 20:48:47,521 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 20:48:47,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:48:47" (1/1) ... [2024-11-19 20:48:47,560 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:48:47" (1/1) ... [2024-11-19 20:48:47,594 INFO L138 Inliner]: procedures = 127, calls = 58, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 187 [2024-11-19 20:48:47,599 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 20:48:47,600 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 20:48:47,600 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 20:48:47,600 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 20:48:47,609 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:48:47" (1/1) ... [2024-11-19 20:48:47,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:48:47" (1/1) ... [2024-11-19 20:48:47,616 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:48:47" (1/1) ... [2024-11-19 20:48:47,659 INFO L175 MemorySlicer]: Split 40 memory accesses to 3 slices as follows [2, 26, 12]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 18 writes are split as follows [0, 17, 1]. [2024-11-19 20:48:47,659 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:48:47" (1/1) ... [2024-11-19 20:48:47,659 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:48:47" (1/1) ... [2024-11-19 20:48:47,679 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:48:47" (1/1) ... [2024-11-19 20:48:47,689 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:48:47" (1/1) ... [2024-11-19 20:48:47,691 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:48:47" (1/1) ... [2024-11-19 20:48:47,698 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:48:47" (1/1) ... [2024-11-19 20:48:47,701 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 20:48:47,710 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 20:48:47,710 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 20:48:47,710 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 20:48:47,711 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:48:47" (1/1) ... [2024-11-19 20:48:47,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 20:48:47,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:48:47,757 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-11-19 20:48:47,759 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-11-19 20:48:47,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 20:48:47,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 20:48:47,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 20:48:47,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 20:48:47,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 20:48:47,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 20:48:47,805 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-19 20:48:47,805 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-19 20:48:47,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 20:48:47,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 20:48:47,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 20:48:47,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 20:48:47,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 20:48:47,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 20:48:47,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 20:48:47,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 20:48:47,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 20:48:47,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 20:48:47,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 20:48:47,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 20:48:47,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-19 20:48:47,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 20:48:47,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 20:48:47,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 20:48:47,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 20:48:47,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 20:48:47,983 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 20:48:47,989 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 20:48:48,332 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-11-19 20:48:48,332 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 20:48:48,345 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 20:48:48,346 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-19 20:48:48,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:48:48 BoogieIcfgContainer [2024-11-19 20:48:48,346 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 20:48:48,348 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 20:48:48,348 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 20:48:48,351 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 20:48:48,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:48:46" (1/3) ... [2024-11-19 20:48:48,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ddfe4d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:48:48, skipping insertion in model container [2024-11-19 20:48:48,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:48:47" (2/3) ... [2024-11-19 20:48:48,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ddfe4d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:48:48, skipping insertion in model container [2024-11-19 20:48:48,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:48:48" (3/3) ... [2024-11-19 20:48:48,353 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2024-11-19 20:48:48,367 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 20:48:48,368 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 20:48:48,411 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 20:48:48,416 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;@5bc8c5f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 20:48:48,416 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 20:48:48,419 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 39 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 20:48:48,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 20:48:48,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:48:48,426 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:48:48,426 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:48:48,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:48:48,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1243287101, now seen corresponding path program 1 times [2024-11-19 20:48:48,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:48:48,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448605346] [2024-11-19 20:48:48,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:48:48,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:48:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:48:48,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:48:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:48:48,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 20:48:48,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:48:48,741 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 20:48:48,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:48:48,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448605346] [2024-11-19 20:48:48,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448605346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:48:48,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:48:48,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 20:48:48,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981969718] [2024-11-19 20:48:48,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:48:48,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 20:48:48,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:48:48,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 20:48:48,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 20:48:48,802 INFO L87 Difference]: Start difference. First operand has 44 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 39 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 20:48:48,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:48:48,900 INFO L93 Difference]: Finished difference Result 79 states and 114 transitions. [2024-11-19 20:48:48,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 20:48:48,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2024-11-19 20:48:48,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:48:48,908 INFO L225 Difference]: With dead ends: 79 [2024-11-19 20:48:48,908 INFO L226 Difference]: Without dead ends: 36 [2024-11-19 20:48:48,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 20:48:48,914 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 20:48:48,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 20:48:48,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-19 20:48:48,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-19 20:48:48,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 20:48:48,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2024-11-19 20:48:48,949 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 25 [2024-11-19 20:48:48,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:48:48,951 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2024-11-19 20:48:48,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 20:48:48,951 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2024-11-19 20:48:48,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 20:48:48,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:48:48,952 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:48:48,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 20:48:48,953 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:48:48,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:48:48,953 INFO L85 PathProgramCache]: Analyzing trace with hash -709703190, now seen corresponding path program 1 times [2024-11-19 20:48:48,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:48:48,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084379164] [2024-11-19 20:48:48,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:48:48,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:48:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:48:49,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:48:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:48:49,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 20:48:49,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:48:49,165 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 20:48:49,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:48:49,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084379164] [2024-11-19 20:48:49,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084379164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:48:49,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:48:49,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 20:48:49,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145899360] [2024-11-19 20:48:49,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:48:49,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 20:48:49,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:48:49,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 20:48:49,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:48:49,168 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 20:48:49,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:48:49,215 INFO L93 Difference]: Finished difference Result 68 states and 89 transitions. [2024-11-19 20:48:49,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 20:48:49,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2024-11-19 20:48:49,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:48:49,216 INFO L225 Difference]: With dead ends: 68 [2024-11-19 20:48:49,216 INFO L226 Difference]: Without dead ends: 41 [2024-11-19 20:48:49,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:48:49,217 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 4 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:48:49,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 108 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:48:49,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-19 20:48:49,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2024-11-19 20:48:49,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 20:48:49,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2024-11-19 20:48:49,223 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 25 [2024-11-19 20:48:49,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:48:49,223 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2024-11-19 20:48:49,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 20:48:49,224 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2024-11-19 20:48:49,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 20:48:49,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:48:49,224 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:48:49,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 20:48:49,225 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:48:49,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:48:49,225 INFO L85 PathProgramCache]: Analyzing trace with hash -37646058, now seen corresponding path program 1 times [2024-11-19 20:48:49,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:48:49,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730971758] [2024-11-19 20:48:49,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:48:49,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:48:49,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:48:49,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:48:49,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:48:49,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 20:48:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:48:49,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 20:48:49,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:48:49,379 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 20:48:49,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:48:49,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730971758] [2024-11-19 20:48:49,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730971758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:48:49,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:48:49,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 20:48:49,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220070378] [2024-11-19 20:48:49,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:48:49,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 20:48:49,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:48:49,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 20:48:49,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:48:49,384 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 20:48:49,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:48:49,441 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2024-11-19 20:48:49,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 20:48:49,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2024-11-19 20:48:49,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:48:49,443 INFO L225 Difference]: With dead ends: 53 [2024-11-19 20:48:49,443 INFO L226 Difference]: Without dead ends: 39 [2024-11-19 20:48:49,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:48:49,444 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:48:49,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:48:49,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-19 20:48:49,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-19 20:48:49,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 20:48:49,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2024-11-19 20:48:49,452 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 35 [2024-11-19 20:48:49,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:48:49,452 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2024-11-19 20:48:49,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 20:48:49,453 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2024-11-19 20:48:49,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 20:48:49,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:48:49,454 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:48:49,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 20:48:49,454 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:48:49,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:48:49,454 INFO L85 PathProgramCache]: Analyzing trace with hash 368663721, now seen corresponding path program 1 times [2024-11-19 20:48:49,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:48:49,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431229376] [2024-11-19 20:48:49,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:48:49,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:48:49,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:48:51,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:48:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:48:51,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 20:48:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:48:51,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 20:48:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:48:51,574 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 20:48:51,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:48:51,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431229376] [2024-11-19 20:48:51,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431229376] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:48:51,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710064015] [2024-11-19 20:48:51,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:48:51,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:48:51,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:48:51,578 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-11-19 20:48:51,579 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-11-19 20:48:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:48:51,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 122 conjuncts are in the unsatisfiable core [2024-11-19 20:48:51,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:48:51,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 20:48:52,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 20:48:52,255 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 20:48:52,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-19 20:48:52,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 20:48:52,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 20:48:52,455 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 20:48:52,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2024-11-19 20:48:52,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-19 20:48:52,631 INFO L349 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2024-11-19 20:48:52,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 48 [2024-11-19 20:48:52,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:48:52,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2024-11-19 20:48:52,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2024-11-19 20:48:52,996 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-19 20:48:52,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 24 [2024-11-19 20:48:53,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-11-19 20:48:53,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-11-19 20:48:53,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:48:53,272 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-19 20:48:53,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 46 [2024-11-19 20:48:53,287 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-19 20:48:53,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-19 20:48:53,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-19 20:48:53,475 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-19 20:48:53,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 26 [2024-11-19 20:48:53,595 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-11-19 20:48:53,599 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-11-19 20:48:53,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-19 20:48:53,732 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:48:53,732 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:48:53,785 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_607) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_605) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_606) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= v_ArrVal_607 (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| (select v_ArrVal_607 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|)))))) is different from false [2024-11-19 20:48:53,799 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (or (not (= v_ArrVal_607 (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select v_ArrVal_607 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_607) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_605) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) v_ArrVal_606) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2024-11-19 20:48:53,808 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| .cse0 v_ArrVal_607) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_605) (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1) v_ArrVal_606) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= v_ArrVal_607 (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_607 .cse1))))))) is different from false [2024-11-19 20:48:53,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710064015] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:48:53,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:48:53,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 45 [2024-11-19 20:48:53,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668467312] [2024-11-19 20:48:53,932 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:48:53,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-19 20:48:53,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:48:53,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-19 20:48:53,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2016, Unknown=3, NotChecked=276, Total=2450 [2024-11-19 20:48:53,940 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand has 45 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 36 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 20:48:55,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:48:55,537 INFO L93 Difference]: Finished difference Result 83 states and 110 transitions. [2024-11-19 20:48:55,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-19 20:48:55,538 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 36 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2024-11-19 20:48:55,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:48:55,539 INFO L225 Difference]: With dead ends: 83 [2024-11-19 20:48:55,539 INFO L226 Difference]: Without dead ends: 81 [2024-11-19 20:48:55,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 965 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=293, Invalid=3748, Unknown=3, NotChecked=378, Total=4422 [2024-11-19 20:48:55,541 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 104 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 20:48:55,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 434 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 20:48:55,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-19 20:48:55,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 59. [2024-11-19 20:48:55,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 20:48:55,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 77 transitions. [2024-11-19 20:48:55,554 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 77 transitions. Word has length 36 [2024-11-19 20:48:55,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:48:55,554 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 77 transitions. [2024-11-19 20:48:55,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 36 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 20:48:55,555 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2024-11-19 20:48:55,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 20:48:55,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:48:55,556 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:48:55,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 20:48:55,760 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-11-19 20:48:55,761 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:48:55,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:48:55,761 INFO L85 PathProgramCache]: Analyzing trace with hash -220702884, now seen corresponding path program 1 times [2024-11-19 20:48:55,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:48:55,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797513335] [2024-11-19 20:48:55,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:48:55,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:48:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:48:55,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:48:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:48:55,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 20:48:55,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:48:55,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 20:48:55,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:48:55,906 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 20:48:55,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:48:55,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797513335] [2024-11-19 20:48:55,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797513335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:48:55,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:48:55,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 20:48:55,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994341593] [2024-11-19 20:48:55,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:48:55,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 20:48:55,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:48:55,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 20:48:55,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 20:48:55,907 INFO L87 Difference]: Start difference. First operand 59 states and 77 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 20:48:55,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:48:55,956 INFO L93 Difference]: Finished difference Result 77 states and 99 transitions. [2024-11-19 20:48:55,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 20:48:55,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2024-11-19 20:48:55,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:48:55,957 INFO L225 Difference]: With dead ends: 77 [2024-11-19 20:48:55,957 INFO L226 Difference]: Without dead ends: 60 [2024-11-19 20:48:55,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 20:48:55,958 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 28 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:48:55,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 115 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:48:55,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-19 20:48:55,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2024-11-19 20:48:55,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 20:48:55,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 74 transitions. [2024-11-19 20:48:55,969 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 74 transitions. Word has length 37 [2024-11-19 20:48:55,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:48:55,969 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 74 transitions. [2024-11-19 20:48:55,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 20:48:55,969 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 74 transitions. [2024-11-19 20:48:55,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 20:48:55,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:48:55,970 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:48:55,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 20:48:55,970 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:48:55,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:48:55,970 INFO L85 PathProgramCache]: Analyzing trace with hash 79364982, now seen corresponding path program 2 times [2024-11-19 20:48:55,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:48:55,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287477243] [2024-11-19 20:48:55,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:48:55,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:48:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:48:56,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:48:56,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:48:56,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 20:48:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:48:56,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 20:48:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:48:56,171 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 20:48:56,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:48:56,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287477243] [2024-11-19 20:48:56,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287477243] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:48:56,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96429814] [2024-11-19 20:48:56,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 20:48:56,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:48:56,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:48:56,173 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-11-19 20:48:56,178 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-11-19 20:48:56,369 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 20:48:56,369 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 20:48:56,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 20:48:56,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:48:56,420 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 20:48:56,420 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 20:48:56,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96429814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:48:56,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 20:48:56,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2024-11-19 20:48:56,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547500124] [2024-11-19 20:48:56,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:48:56,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 20:48:56,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:48:56,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 20:48:56,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 20:48:56,422 INFO L87 Difference]: Start difference. First operand 58 states and 74 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 20:48:56,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:48:56,461 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2024-11-19 20:48:56,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 20:48:56,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2024-11-19 20:48:56,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:48:56,464 INFO L225 Difference]: With dead ends: 78 [2024-11-19 20:48:56,464 INFO L226 Difference]: Without dead ends: 60 [2024-11-19 20:48:56,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-19 20:48:56,465 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 27 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:48:56,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 93 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:48:56,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-19 20:48:56,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2024-11-19 20:48:56,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 20:48:56,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2024-11-19 20:48:56,478 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 37 [2024-11-19 20:48:56,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:48:56,479 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2024-11-19 20:48:56,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 20:48:56,479 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2024-11-19 20:48:56,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-19 20:48:56,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:48:56,482 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:48:56,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 20:48:56,682 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,SelfDestructingSolverStorable5 [2024-11-19 20:48:56,682 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:48:56,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:48:56,683 INFO L85 PathProgramCache]: Analyzing trace with hash -599029201, now seen corresponding path program 1 times [2024-11-19 20:48:56,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:48:56,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956232037] [2024-11-19 20:48:56,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:48:56,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:48:56,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:48:56,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:48:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:48:56,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 20:48:56,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:48:56,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 20:48:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:48:56,826 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 20:48:56,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:48:56,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956232037] [2024-11-19 20:48:56,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956232037] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:48:56,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959812458] [2024-11-19 20:48:56,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:48:56,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:48:56,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:48:56,829 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-11-19 20:48:56,833 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-11-19 20:48:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:48:57,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 20:48:57,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:48:57,020 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 20:48:57,021 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:48:57,085 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 20:48:57,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959812458] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:48:57,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:48:57,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2024-11-19 20:48:57,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093782104] [2024-11-19 20:48:57,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:48:57,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 20:48:57,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:48:57,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 20:48:57,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 20:48:57,087 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 20:48:57,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:48:57,189 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2024-11-19 20:48:57,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 20:48:57,190 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2024-11-19 20:48:57,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:48:57,190 INFO L225 Difference]: With dead ends: 73 [2024-11-19 20:48:57,191 INFO L226 Difference]: Without dead ends: 58 [2024-11-19 20:48:57,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-19 20:48:57,191 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 20:48:57,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 207 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 20:48:57,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-19 20:48:57,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-19 20:48:57,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 20:48:57,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2024-11-19 20:48:57,203 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 38 [2024-11-19 20:48:57,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:48:57,203 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2024-11-19 20:48:57,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 20:48:57,204 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2024-11-19 20:48:57,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-19 20:48:57,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:48:57,204 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:48:57,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 20:48:57,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:48:57,405 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:48:57,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:48:57,405 INFO L85 PathProgramCache]: Analyzing trace with hash -541770899, now seen corresponding path program 1 times [2024-11-19 20:48:57,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:48:57,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34252400] [2024-11-19 20:48:57,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:48:57,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:48:57,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:48:57,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:48:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:48:57,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 20:48:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:48:57,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 20:48:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:48:57,691 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 20:48:57,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:48:57,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34252400] [2024-11-19 20:48:57,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34252400] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:48:57,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913405471] [2024-11-19 20:48:57,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:48:57,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:48:57,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:48:57,696 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:48:57,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 20:48:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:48:57,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-19 20:48:57,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:48:57,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-19 20:48:58,006 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 20:48:58,006 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:48:58,039 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 20:48:58,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913405471] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:48:58,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:48:58,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 16 [2024-11-19 20:48:58,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262306260] [2024-11-19 20:48:58,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:48:58,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 20:48:58,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:48:58,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 20:48:58,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-11-19 20:48:58,041 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 14 states have internal predecessors, (39), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-19 20:49:02,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 20:49:06,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 20:49:10,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 20:49:14,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 20:49:18,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 20:49:22,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 20:49:26,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 20:49:26,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:49:26,417 INFO L93 Difference]: Finished difference Result 94 states and 114 transitions. [2024-11-19 20:49:26,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 20:49:26,421 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 14 states have internal predecessors, (39), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2024-11-19 20:49:26,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:49:26,421 INFO L225 Difference]: With dead ends: 94 [2024-11-19 20:49:26,422 INFO L226 Difference]: Without dead ends: 61 [2024-11-19 20:49:26,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2024-11-19 20:49:26,423 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 33 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.2s IncrementalHoareTripleChecker+Time [2024-11-19 20:49:26,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 384 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 255 Invalid, 7 Unknown, 0 Unchecked, 28.2s Time] [2024-11-19 20:49:26,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-19 20:49:26,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-19 20:49:26,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 52 states have internal predecessors, (60), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 20:49:26,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2024-11-19 20:49:26,453 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 38 [2024-11-19 20:49:26,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:49:26,453 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2024-11-19 20:49:26,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 14 states have internal predecessors, (39), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-19 20:49:26,453 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2024-11-19 20:49:26,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-19 20:49:26,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:49:26,461 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:49:26,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 20:49:26,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:49:26,662 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:49:26,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:49:26,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1955198847, now seen corresponding path program 1 times [2024-11-19 20:49:26,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:49:26,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513878282] [2024-11-19 20:49:26,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:49:26,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:49:26,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:29,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:49:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:29,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 20:49:29,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:29,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 20:49:29,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:29,381 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 20:49:29,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:49:29,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513878282] [2024-11-19 20:49:29,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513878282] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:49:29,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673559493] [2024-11-19 20:49:29,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:49:29,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:49:29,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:49:29,383 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:49:29,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 20:49:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:29,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 160 conjuncts are in the unsatisfiable core [2024-11-19 20:49:29,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:49:29,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 20:49:30,107 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) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |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) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)))) is different from false [2024-11-19 20:49:30,109 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) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |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) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)))) is different from true [2024-11-19 20:49:30,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 20:49:30,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 20:49:30,144 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) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |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)) is different from false [2024-11-19 20:49:30,145 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) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |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)) is different from true [2024-11-19 20:49:30,164 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 20:49:30,164 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 16 treesize of output 15 [2024-11-19 20:49:30,193 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 20:49:30,194 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 16 treesize of output 15 [2024-11-19 20:49:30,198 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 5 treesize of output 3 [2024-11-19 20:49:30,205 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) .cse0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))))) is different from false [2024-11-19 20:49:30,207 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) .cse0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) .cse0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))))) is different from true [2024-11-19 20:49:30,233 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0) .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse0 (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_14| |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-11-19 20:49:30,235 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0) .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse0 (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_14| |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-11-19 20:49:30,293 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 48 [2024-11-19 20:49:30,301 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 20 treesize of output 19 [2024-11-19 20:49:30,322 INFO L349 Elim1Store]: treesize reduction 49, result has 27.9 percent of original size [2024-11-19 20:49:30,322 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 1 case distinctions, treesize of input 63 treesize of output 19 [2024-11-19 20:49:30,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2024-11-19 20:49:30,339 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 67 treesize of output 30 [2024-11-19 20:49:30,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 66 [2024-11-19 20:49:30,364 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse1 (select .cse10 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 1))) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse2 (= .cse1 |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (or (let ((.cse6 (select |c_#memory_$Pointer$#1.offset| .cse1))) (let ((.cse4 (select .cse6 4))) (and .cse2 (= (select .cse3 .cse4) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_2) .cse1 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (and (= .cse5 v_DerPreprocessor_2) (= (store .cse5 4 .cse4) .cse6) (= (select v_DerPreprocessor_3 .cse4) 0))))))) (let ((.cse9 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse7 (select .cse9 4))) (and (exists ((v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_4) .cse1 v_arrayElimArr_4) |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (and (= (select v_arrayElimArr_4 .cse7) 0) (= (select .cse8 0) 0) (= (store .cse8 4 .cse7) .cse9)))) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| (select .cse3 .cse7)) (= .cse1 (select .cse10 0)) (not .cse2))))))))) is different from false [2024-11-19 20:49:30,366 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse1 (select .cse10 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 1))) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse2 (= .cse1 |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (or (let ((.cse6 (select |c_#memory_$Pointer$#1.offset| .cse1))) (let ((.cse4 (select .cse6 4))) (and .cse2 (= (select .cse3 .cse4) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_2) .cse1 v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (and (= .cse5 v_DerPreprocessor_2) (= (store .cse5 4 .cse4) .cse6) (= (select v_DerPreprocessor_3 .cse4) 0))))))) (let ((.cse9 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse7 (select .cse9 4))) (and (exists ((v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_4) .cse1 v_arrayElimArr_4) |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (and (= (select v_arrayElimArr_4 .cse7) 0) (= (select .cse8 0) 0) (= (store .cse8 4 .cse7) .cse9)))) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| (select .cse3 .cse7)) (= .cse1 (select .cse10 0)) (not .cse2))))))))) is different from true [2024-11-19 20:49:30,475 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse4 (select .cse7 4))) (and (let ((.cse6 (= .cse4 .cse3)) (.cse5 (select |c_#memory_$Pointer$#1.base| .cse4))) (or (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| .cse4))) (let ((.cse2 (select .cse1 4))) (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_$Pointer$#1.offset| .cse3 v_DerPreprocessor_2) .cse4 v_DerPreprocessor_3) .cse3))) (and (= v_DerPreprocessor_2 .cse0) (= .cse1 (store .cse0 4 .cse2)) (= (select v_DerPreprocessor_3 .cse2) 0)))) (= (select .cse5 .cse2) .cse3) .cse6))) (let ((.cse8 (select |c_#memory_$Pointer$#1.offset| .cse3))) (let ((.cse10 (select .cse8 4))) (and (= .cse4 (select .cse7 0)) (not .cse6) (exists ((v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_$Pointer$#1.offset| .cse3 v_DerPreprocessor_4) .cse4 v_arrayElimArr_4) .cse3))) (and (= .cse8 (store .cse9 4 .cse10)) (= (select v_arrayElimArr_4 .cse10) 0) (= (select .cse9 0) 0)))) (= .cse3 (select .cse5 .cse10))))))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |c_#valid| .cse3) 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|) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse4) 1) (= |c_#valid| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse11 (select |c_#valid| .cse11)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse3) 0))) (= |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))))) is different from false [2024-11-19 20:49:30,477 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse4 (select .cse7 4))) (and (let ((.cse6 (= .cse4 .cse3)) (.cse5 (select |c_#memory_$Pointer$#1.base| .cse4))) (or (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| .cse4))) (let ((.cse2 (select .cse1 4))) (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_$Pointer$#1.offset| .cse3 v_DerPreprocessor_2) .cse4 v_DerPreprocessor_3) .cse3))) (and (= v_DerPreprocessor_2 .cse0) (= .cse1 (store .cse0 4 .cse2)) (= (select v_DerPreprocessor_3 .cse2) 0)))) (= (select .cse5 .cse2) .cse3) .cse6))) (let ((.cse8 (select |c_#memory_$Pointer$#1.offset| .cse3))) (let ((.cse10 (select .cse8 4))) (and (= .cse4 (select .cse7 0)) (not .cse6) (exists ((v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_$Pointer$#1.offset| .cse3 v_DerPreprocessor_4) .cse4 v_arrayElimArr_4) .cse3))) (and (= .cse8 (store .cse9 4 .cse10)) (= (select v_arrayElimArr_4 .cse10) 0) (= (select .cse9 0) 0)))) (= .cse3 (select .cse5 .cse10))))))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |c_#valid| .cse3) 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|) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse4) 1) (= |c_#valid| (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse11 (select |c_#valid| .cse11)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse3) 0))) (= |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))))) is different from true [2024-11-19 20:49:30,514 INFO L349 Elim1Store]: treesize reduction 81, result has 16.5 percent of original size [2024-11-19 20:49:30,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 307 treesize of output 193 [2024-11-19 20:49:30,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:49:30,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:49:30,522 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 115 treesize of output 83 [2024-11-19 20:49:30,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 76 [2024-11-19 20:49:30,534 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 65 treesize of output 61 [2024-11-19 20:49:30,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 64 [2024-11-19 20:49:30,545 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 56 treesize of output 52 [2024-11-19 20:49:30,583 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-11-19 20:49:30,585 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-11-19 20:49:30,608 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 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-11-19 20:49:30,610 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 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-11-19 20:49:30,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 20:49:30,661 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_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 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|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|)))) is different from false [2024-11-19 20:49:30,663 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_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_6) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 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|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|)))) is different from true [2024-11-19 20:49:30,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:49:30,753 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-19 20:49:30,753 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 315 treesize of output 228 [2024-11-19 20:49:30,804 INFO L349 Elim1Store]: treesize reduction 48, result has 56.8 percent of original size [2024-11-19 20:49:30,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 394 treesize of output 352 [2024-11-19 20:49:30,814 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 133 treesize of output 129 [2024-11-19 20:49:30,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 135 [2024-11-19 20:49:30,875 INFO L349 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2024-11-19 20:49:30,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2024-11-19 20:49:30,899 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 7 treesize of output 5 [2024-11-19 20:49:30,930 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 27 treesize of output 23 [2024-11-19 20:49:31,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:49:31,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 38 [2024-11-19 20:49:31,091 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-19 20:49:31,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:49:31,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 38 [2024-11-19 20:49:31,170 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))) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse14 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |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_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse3) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| .cse0))) (let ((.cse12 (= .cse0 .cse1)) (.cse9 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse11 (select .cse5 4))) (let ((.cse8 (= (select .cse9 .cse11) .cse1)) (.cse6 (= .cse0 (select .cse14 0))) (.cse7 (not .cse12)) (.cse10 (= .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (or (and (or (and (= (select .cse5 0) 0) .cse6 .cse7 .cse8) (and .cse6 .cse7 (exists ((v_arrayElimCell_51 Int)) (= .cse1 (select .cse9 v_arrayElimCell_51))))) .cse10) (and (or (= (select .cse5 .cse11) 0) (= 4 .cse11)) .cse8 .cse12) (let ((.cse13 (select |c_#memory_$Pointer$#1.offset| .cse1))) (and .cse6 .cse7 (= .cse1 (select .cse9 (select .cse13 4))) (= (select .cse13 0) 0))) (and (= .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) (or (and (exists ((v_arrayElimIndex_9 Int)) (= .cse1 (select .cse9 v_arrayElimIndex_9))) .cse10) (and (exists ((v_arrayElimIndex_10 Int)) (= .cse1 (select .cse9 v_arrayElimIndex_10))) .cse12))))))))))) is different from false [2024-11-19 20:49:31,173 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))) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse14 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |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_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse3) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| .cse0))) (let ((.cse12 (= .cse0 .cse1)) (.cse9 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse11 (select .cse5 4))) (let ((.cse8 (= (select .cse9 .cse11) .cse1)) (.cse6 (= .cse0 (select .cse14 0))) (.cse7 (not .cse12)) (.cse10 (= .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (or (and (or (and (= (select .cse5 0) 0) .cse6 .cse7 .cse8) (and .cse6 .cse7 (exists ((v_arrayElimCell_51 Int)) (= .cse1 (select .cse9 v_arrayElimCell_51))))) .cse10) (and (or (= (select .cse5 .cse11) 0) (= 4 .cse11)) .cse8 .cse12) (let ((.cse13 (select |c_#memory_$Pointer$#1.offset| .cse1))) (and .cse6 .cse7 (= .cse1 (select .cse9 (select .cse13 4))) (= (select .cse13 0) 0))) (and (= .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) (or (and (exists ((v_arrayElimIndex_9 Int)) (= .cse1 (select .cse9 v_arrayElimIndex_9))) .cse10) (and (exists ((v_arrayElimIndex_10 Int)) (= .cse1 (select .cse9 v_arrayElimIndex_10))) .cse12))))))))))) is different from true [2024-11-19 20:49:31,329 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse0 (select .cse11 4))) (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) (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| .cse0))) (let ((.cse4 (= .cse0 .cse2)) (.cse3 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse6 (select .cse5 4))) (let ((.cse1 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse2)) (.cse7 (= (select .cse3 .cse6) .cse2)) (.cse8 (= .cse0 (select .cse11 0))) (.cse9 (not .cse4))) (or (and (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse0) (or (and .cse1 (exists ((v_arrayElimIndex_9 Int)) (= .cse2 (select .cse3 v_arrayElimIndex_9)))) (and (exists ((v_arrayElimIndex_10 Int)) (= .cse2 (select .cse3 v_arrayElimIndex_10))) .cse4))) (and (or (= (select .cse5 .cse6) 0) (= 4 .cse6)) .cse7 .cse4) (let ((.cse10 (select |c_#memory_$Pointer$#1.offset| .cse2))) (and .cse8 .cse9 (= .cse2 (select .cse3 (select .cse10 4))) (= (select .cse10 0) 0))) (and .cse1 (or (and (= (select .cse5 0) 0) .cse8 .cse9 .cse7) (and .cse8 .cse9 (exists ((v_arrayElimCell_51 Int)) (= .cse2 (select .cse3 v_arrayElimCell_51)))))))))) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse12) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse13 (select |v_#valid_BEFORE_CALL_7| .cse13)))) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse12) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= .cse2 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse2) 1) (= (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse14 (select |v_old(#valid)_AFTER_CALL_15| .cse14))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 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-11-19 20:49:31,332 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse0 (select .cse11 4))) (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) (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| .cse0))) (let ((.cse4 (= .cse0 .cse2)) (.cse3 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse6 (select .cse5 4))) (let ((.cse1 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse2)) (.cse7 (= (select .cse3 .cse6) .cse2)) (.cse8 (= .cse0 (select .cse11 0))) (.cse9 (not .cse4))) (or (and (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse0) (or (and .cse1 (exists ((v_arrayElimIndex_9 Int)) (= .cse2 (select .cse3 v_arrayElimIndex_9)))) (and (exists ((v_arrayElimIndex_10 Int)) (= .cse2 (select .cse3 v_arrayElimIndex_10))) .cse4))) (and (or (= (select .cse5 .cse6) 0) (= 4 .cse6)) .cse7 .cse4) (let ((.cse10 (select |c_#memory_$Pointer$#1.offset| .cse2))) (and .cse8 .cse9 (= .cse2 (select .cse3 (select .cse10 4))) (= (select .cse10 0) 0))) (and .cse1 (or (and (= (select .cse5 0) 0) .cse8 .cse9 .cse7) (and .cse8 .cse9 (exists ((v_arrayElimCell_51 Int)) (= .cse2 (select .cse3 v_arrayElimCell_51)))))))))) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse12) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse13 (select |v_#valid_BEFORE_CALL_7| .cse13)))) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse12) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= .cse2 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse2) 1) (= (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse14 (select |v_old(#valid)_AFTER_CALL_15| .cse14))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 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-11-19 20:49:31,591 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 ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse11 4))) (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_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| .cse1))) (let ((.cse4 (= .cse1 .cse0)) (.cse3 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse6 (select .cse5 4))) (let ((.cse2 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse0)) (.cse7 (= (select .cse3 .cse6) .cse0)) (.cse8 (= .cse1 (select .cse11 0))) (.cse9 (not .cse4))) (or (and (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse1) (or (and .cse2 (exists ((v_arrayElimIndex_9 Int)) (= .cse0 (select .cse3 v_arrayElimIndex_9)))) (and (exists ((v_arrayElimIndex_10 Int)) (= .cse0 (select .cse3 v_arrayElimIndex_10))) .cse4))) (and (or (= (select .cse5 .cse6) 0) (= 4 .cse6)) .cse7 .cse4) (let ((.cse10 (select |c_#memory_$Pointer$#1.offset| .cse0))) (and .cse8 .cse9 (= .cse0 (select .cse3 (select .cse10 4))) (= (select .cse10 0) 0))) (and .cse2 (or (and (= (select .cse5 0) 0) .cse8 .cse9 .cse7) (and .cse8 .cse9 (exists ((v_arrayElimCell_51 Int)) (= .cse0 (select .cse3 v_arrayElimCell_51)))))))))) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse12) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse13 (select |v_#valid_BEFORE_CALL_7| .cse13)))) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse12) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) 0)) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse14 (select |v_old(#valid)_AFTER_CALL_15| .cse14))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 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-11-19 20:49:31,601 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 ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse11 4))) (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_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| .cse1))) (let ((.cse4 (= .cse1 .cse0)) (.cse3 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse6 (select .cse5 4))) (let ((.cse2 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse0)) (.cse7 (= (select .cse3 .cse6) .cse0)) (.cse8 (= .cse1 (select .cse11 0))) (.cse9 (not .cse4))) (or (and (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse1) (or (and .cse2 (exists ((v_arrayElimIndex_9 Int)) (= .cse0 (select .cse3 v_arrayElimIndex_9)))) (and (exists ((v_arrayElimIndex_10 Int)) (= .cse0 (select .cse3 v_arrayElimIndex_10))) .cse4))) (and (or (= (select .cse5 .cse6) 0) (= 4 .cse6)) .cse7 .cse4) (let ((.cse10 (select |c_#memory_$Pointer$#1.offset| .cse0))) (and .cse8 .cse9 (= .cse0 (select .cse3 (select .cse10 4))) (= (select .cse10 0) 0))) (and .cse2 (or (and (= (select .cse5 0) 0) .cse8 .cse9 .cse7) (and .cse8 .cse9 (exists ((v_arrayElimCell_51 Int)) (= .cse0 (select .cse3 v_arrayElimCell_51)))))))))) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse12) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse13 (select |v_#valid_BEFORE_CALL_7| .cse13)))) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse12) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) 0)) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse14 (select |v_old(#valid)_AFTER_CALL_15| .cse14))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 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-11-19 20:49:31,858 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 20:49:31,860 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-19 20:49:31,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:49:31,878 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 61 treesize of output 22 [2024-11-19 20:49:31,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:49:31,902 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-19 20:49:31,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 257 treesize of output 232 [2024-11-19 20:49:31,961 INFO L349 Elim1Store]: treesize reduction 272, result has 9.9 percent of original size [2024-11-19 20:49:31,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 12 case distinctions, treesize of input 319 treesize of output 180 [2024-11-19 20:49:32,005 INFO L349 Elim1Store]: treesize reduction 109, result has 7.6 percent of original size [2024-11-19 20:49:32,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 344 treesize of output 196 [2024-11-19 20:49:32,024 INFO L349 Elim1Store]: treesize reduction 128, result has 13.5 percent of original size [2024-11-19 20:49:32,024 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 2 case distinctions, treesize of input 214 treesize of output 162 [2024-11-19 20:49:32,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:49:32,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 133 treesize of output 162 [2024-11-19 20:49:32,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 19 [2024-11-19 20:49:32,165 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 20:49:32,175 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-19 20:49:32,183 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 20:49:32,188 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-19 20:49:32,209 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))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse0 (select .cse9 0)) (.cse2 (select .cse9 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse0) 8)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse1 .cse0)) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse3 (select |v_old(#valid)_AFTER_CALL_15| .cse3))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 0))) (= (select .cse4 0) 0) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse5) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse6 (select |v_#valid_BEFORE_CALL_7| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse5) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (let ((.cse8 (= .cse2 .cse1))) (or (and (let ((.cse7 (select .cse4 4))) (or (= 0 (select .cse4 .cse7)) (= .cse7 4))) .cse8) (and (not (= .cse2 .cse0)) (not .cse8)))))))) is different from false [2024-11-19 20:49:32,214 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))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse0 (select .cse9 0)) (.cse2 (select .cse9 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse0) 8)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse1 .cse0)) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse3 (select |v_old(#valid)_AFTER_CALL_15| .cse3))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 0))) (= (select .cse4 0) 0) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse5) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse6 (select |v_#valid_BEFORE_CALL_7| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse5) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0)))) (let ((.cse8 (= .cse2 .cse1))) (or (and (let ((.cse7 (select .cse4 4))) (or (= 0 (select .cse4 .cse7)) (= .cse7 4))) .cse8) (and (not (= .cse2 .cse0)) (not .cse8)))))))) is different from true [2024-11-19 20:49:32,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:49:32,255 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 197 treesize of output 125 [2024-11-19 20:49:32,367 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (let ((.cse2 (select .cse7 4)) (.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (.cse0 (select .cse7 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) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_old(#valid)_AFTER_CALL_15| .cse1))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_14| .cse2)))) (let ((.cse5 (= .cse2 |c_ULTIMATE.start_main_~ptr~0#1.base|))) (or (and (let ((.cse3 (select .cse4 4))) (or (= .cse3 4) (= (select .cse4 .cse3) 0))) .cse5) (and (not .cse5) (not (= .cse2 .cse0))))) (= (select .cse4 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_4| Int)) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)))) (and (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0)) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_7| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse6 (select |v_#valid_BEFORE_CALL_7| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_16| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1)))))))) is different from false [2024-11-19 20:49:32,370 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (let ((.cse2 (select .cse7 4)) (.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (.cse0 (select .cse7 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) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_old(#valid)_AFTER_CALL_15| .cse1))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_14| .cse2)))) (let ((.cse5 (= .cse2 |c_ULTIMATE.start_main_~ptr~0#1.base|))) (or (and (let ((.cse3 (select .cse4 4))) (or (= .cse3 4) (= (select .cse4 .cse3) 0))) .cse5) (and (not .cse5) (not (= .cse2 .cse0))))) (= (select .cse4 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_4| Int)) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)))) (and (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0)) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_7| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse6 (select |v_#valid_BEFORE_CALL_7| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_16| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1)))))))) is different from true [2024-11-19 20:49:32,467 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 94 treesize of output 58 [2024-11-19 20:49:32,482 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:49:32,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 44 [2024-11-19 20:49:32,622 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_~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) (or (and (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0)) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_20| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (v_arrayElimCell_77 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_77) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_old(#valid)_AFTER_CALL_15| .cse1))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 1) (= (select |v_old(#valid)_AFTER_CALL_16| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 0)))) (and (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)))) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_20| Int) (v_arrayElimCell_77 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_77) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 1))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0)) is different from false [2024-11-19 20:49:32,625 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_~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) (or (and (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0)) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_20| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (v_arrayElimCell_77 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_77) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_old(#valid)_AFTER_CALL_15| .cse1))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 1) (= (select |v_old(#valid)_AFTER_CALL_16| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 0)))) (and (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)))) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_20| Int) (v_arrayElimCell_77 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_77) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 1))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0)) is different from true [2024-11-19 20:49:32,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:49:32,691 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 120 treesize of output 132 [2024-11-19 20:49:33,246 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) (or (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_20| Int) (v_arrayElimCell_77 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_77) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_old(#valid)_AFTER_CALL_15| .cse0))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 1))) (exists ((v_prenex_8 (Array Int Int)) (v_arrayElimIndex_6 Int) (v_prenex_9 (Array Int Int)) (v_prenex_12 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (v_prenex_10 Int)) (and (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= (select |v_#valid_BEFORE_CALL_7| v_prenex_10) 1) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_16| v_prenex_10) 0) (= (let ((.cse2 (@diff v_prenex_8 v_prenex_9))) (store v_prenex_8 .cse2 (select v_prenex_9 .cse2))) v_prenex_9) (= (select v_prenex_8 v_prenex_10) 0) (= (select v_prenex_8 v_prenex_12) 1) (= (select v_prenex_9 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_9 v_prenex_10) 1))))) is different from false [2024-11-19 20:49:33,249 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) (or (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_20| Int) (v_arrayElimCell_77 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_77) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_old(#valid)_AFTER_CALL_15| .cse0))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 1))) (exists ((v_prenex_8 (Array Int Int)) (v_arrayElimIndex_6 Int) (v_prenex_9 (Array Int Int)) (v_prenex_12 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (v_prenex_10 Int)) (and (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_16| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_16| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= (select |v_#valid_BEFORE_CALL_7| v_prenex_10) 1) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_16| v_prenex_10) 0) (= (let ((.cse2 (@diff v_prenex_8 v_prenex_9))) (store v_prenex_8 .cse2 (select v_prenex_9 .cse2))) v_prenex_9) (= (select v_prenex_8 v_prenex_10) 0) (= (select v_prenex_8 v_prenex_12) 1) (= (select v_prenex_9 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_9 v_prenex_10) 1))))) is different from true [2024-11-19 20:49:33,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 20:49:33,309 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2024-11-19 20:49:33,309 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:49:33,386 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1745 (Array Int Int)) (v_ArrVal_1744 (Array Int Int)) (v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_ArrVal_1751 (Array Int Int)) (v_DerPreprocessor_8 Int) (v_ArrVal_1743 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1742))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4) v_DerPreprocessor_8) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1743))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1744) (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1741) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1751) .cse1) .cse2)) (+ 8 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1746) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1745) .cse1) .cse2)))))) is different from false [2024-11-19 20:49:33,411 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1745 (Array Int Int)) (v_ArrVal_1744 (Array Int Int)) (v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_DerPreprocessor_8 Int) (v_ArrVal_1751 (Array Int Int)) (v_ArrVal_1743 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1742))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4) v_DerPreprocessor_8) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1743))) .cse1 v_ArrVal_1744) (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1741) .cse1 v_ArrVal_1751) .cse3) .cse4)) (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1746) .cse1 v_ArrVal_1745) .cse3) .cse4) 8)))))) is different from false [2024-11-19 20:49:33,423 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1745 (Array Int Int)) (v_ArrVal_1744 (Array Int Int)) (v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_DerPreprocessor_8 Int) (v_ArrVal_1751 (Array Int Int)) (v_ArrVal_1743 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse1 (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 ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse4 (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 ((.cse2 (select .cse3 .cse4)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int#1| .cse1 v_ArrVal_1742))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 4) v_DerPreprocessor_8) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1743))) .cse2 v_ArrVal_1744) (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse1 (store .cse3 .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1741) .cse2 v_ArrVal_1751) .cse5) .cse6)) (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 (store (select |c_#memory_$Pointer$#1.offset| .cse1) .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1746) .cse2 v_ArrVal_1745) .cse5) .cse6) 8))))))) is different from false [2024-11-19 20:49:33,536 INFO L349 Elim1Store]: treesize reduction 241, result has 51.2 percent of original size [2024-11-19 20:49:33,536 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 2 case distinctions, treesize of input 3318 treesize of output 3302 [2024-11-19 20:49:33,560 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:49:33,560 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 1189 treesize of output 1189 [2024-11-19 20:49:33,578 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 2382 treesize of output 2202 [2024-11-19 20:49:33,595 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 1944 treesize of output 1704 [2024-11-19 20:49:33,739 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 63 treesize of output 3 [2024-11-19 20:49:37,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:49:37,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 5502 treesize of output 7084