./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/sll2c_remove_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 3340815bef7e21ae2d4803d7059577c1761bb3b7b4bb24b2b34d5d0d0054fd10 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 01:43:54,754 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 01:43:54,810 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 01:43:54,814 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 01:43:54,815 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 01:43:54,837 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 01:43:54,838 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 01:43:54,838 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 01:43:54,838 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 01:43:54,839 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 01:43:54,840 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 01:43:54,840 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 01:43:54,840 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 01:43:54,841 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 01:43:54,842 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 01:43:54,842 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 01:43:54,842 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 01:43:54,843 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 01:43:54,843 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 01:43:54,843 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 01:43:54,843 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 01:43:54,845 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 01:43:54,845 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 01:43:54,846 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 01:43:54,846 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 01:43:54,846 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 01:43:54,846 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 01:43:54,846 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 01:43:54,846 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 01:43:54,846 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 01:43:54,847 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 01:43:54,847 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 01:43:54,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:43:54,847 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 01:43:54,847 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 01:43:54,847 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 01:43:54,848 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 01:43:54,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 01:43:54,848 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 01:43:54,848 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 01:43:54,848 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 01:43:54,850 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 01:43:54,850 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-clean/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-clean/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 -> 3340815bef7e21ae2d4803d7059577c1761bb3b7b4bb24b2b34d5d0d0054fd10 [2024-10-11 01:43:55,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 01:43:55,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 01:43:55,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 01:43:55,087 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 01:43:55,088 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 01:43:55,089 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i [2024-10-11 01:43:56,500 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 01:43:56,674 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 01:43:56,674 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i [2024-10-11 01:43:56,685 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d0e4a4556/0f1dfe8717e94c8aa5dcd17289e2a1ec/FLAG697a76ad5 [2024-10-11 01:43:57,052 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d0e4a4556/0f1dfe8717e94c8aa5dcd17289e2a1ec [2024-10-11 01:43:57,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 01:43:57,060 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 01:43:57,066 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 01:43:57,066 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 01:43:57,071 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 01:43:57,072 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:43:57" (1/1) ... [2024-10-11 01:43:57,072 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c73e846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:57, skipping insertion in model container [2024-10-11 01:43:57,074 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:43:57" (1/1) ... [2024-10-11 01:43:57,142 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 01:43:57,437 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i[24151,24164] [2024-10-11 01:43:57,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:43:57,448 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 01:43:57,491 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i[24151,24164] [2024-10-11 01:43:57,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:43:57,520 INFO L204 MainTranslator]: Completed translation [2024-10-11 01:43:57,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:57 WrapperNode [2024-10-11 01:43:57,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 01:43:57,521 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 01:43:57,522 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 01:43:57,522 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 01:43:57,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:57" (1/1) ... [2024-10-11 01:43:57,542 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:57" (1/1) ... [2024-10-11 01:43:57,560 INFO L138 Inliner]: procedures = 126, calls = 36, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 120 [2024-10-11 01:43:57,560 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 01:43:57,561 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 01:43:57,561 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 01:43:57,561 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 01:43:57,570 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:57" (1/1) ... [2024-10-11 01:43:57,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:57" (1/1) ... [2024-10-11 01:43:57,574 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:57" (1/1) ... [2024-10-11 01:43:57,599 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 9, 9]. 45 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 6 writes are split as follows [0, 1, 5]. [2024-10-11 01:43:57,599 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:57" (1/1) ... [2024-10-11 01:43:57,599 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:57" (1/1) ... [2024-10-11 01:43:57,604 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:57" (1/1) ... [2024-10-11 01:43:57,607 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:57" (1/1) ... [2024-10-11 01:43:57,611 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:57" (1/1) ... [2024-10-11 01:43:57,612 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:57" (1/1) ... [2024-10-11 01:43:57,615 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 01:43:57,615 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 01:43:57,616 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 01:43:57,616 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 01:43:57,617 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:57" (1/1) ... [2024-10-11 01:43:57,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:43:57,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:43:57,659 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 01:43:57,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 01:43:57,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 01:43:57,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 01:43:57,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 01:43:57,708 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-11 01:43:57,708 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-11 01:43:57,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 01:43:57,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 01:43:57,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 01:43:57,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 01:43:57,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 01:43:57,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 01:43:57,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 01:43:57,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 01:43:57,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 01:43:57,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 01:43:57,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 01:43:57,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 01:43:57,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 01:43:57,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 01:43:57,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 01:43:57,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 01:43:57,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 01:43:57,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 01:43:57,822 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 01:43:57,824 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 01:43:57,991 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-10-11 01:43:57,995 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 01:43:58,030 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 01:43:58,031 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-11 01:43:58,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:43:58 BoogieIcfgContainer [2024-10-11 01:43:58,032 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 01:43:58,034 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 01:43:58,034 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 01:43:58,036 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 01:43:58,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:43:57" (1/3) ... [2024-10-11 01:43:58,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e761c95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:43:58, skipping insertion in model container [2024-10-11 01:43:58,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:43:57" (2/3) ... [2024-10-11 01:43:58,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e761c95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:43:58, skipping insertion in model container [2024-10-11 01:43:58,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:43:58" (3/3) ... [2024-10-11 01:43:58,039 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_remove_all_reverse.i [2024-10-11 01:43:58,054 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 01:43:58,055 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 01:43:58,127 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 01:43:58,132 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;@35ed833e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 01:43:58,133 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 01:43:58,136 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:43:58,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 01:43:58,143 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:43:58,143 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:43:58,144 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:43:58,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:43:58,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1696884172, now seen corresponding path program 1 times [2024-10-11 01:43:58,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:43:58,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582808020] [2024-10-11 01:43:58,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:43:58,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:43:58,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:58,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:43:58,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:58,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:43:58,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:43:58,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582808020] [2024-10-11 01:43:58,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582808020] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:43:58,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:43:58,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 01:43:58,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430625918] [2024-10-11 01:43:58,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:43:58,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 01:43:58,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:43:58,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 01:43:58,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:43:58,401 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:43:58,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:43:58,459 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2024-10-11 01:43:58,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 01:43:58,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-11 01:43:58,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:43:58,466 INFO L225 Difference]: With dead ends: 42 [2024-10-11 01:43:58,466 INFO L226 Difference]: Without dead ends: 23 [2024-10-11 01:43:58,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:43:58,472 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:43:58,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:43:58,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-11 01:43:58,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-11 01:43:58,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:43:58,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2024-10-11 01:43:58,561 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 12 [2024-10-11 01:43:58,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:43:58,566 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-10-11 01:43:58,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:43:58,566 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2024-10-11 01:43:58,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 01:43:58,567 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:43:58,567 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:43:58,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 01:43:58,568 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:43:58,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:43:58,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1523887835, now seen corresponding path program 1 times [2024-10-11 01:43:58,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:43:58,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527045804] [2024-10-11 01:43:58,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:43:58,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:43:58,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:58,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:43:58,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:58,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:43:58,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:43:58,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527045804] [2024-10-11 01:43:58,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527045804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:43:58,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:43:58,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 01:43:58,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066095982] [2024-10-11 01:43:58,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:43:58,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 01:43:58,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:43:58,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 01:43:58,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:43:58,737 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:43:58,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:43:58,772 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2024-10-11 01:43:58,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 01:43:58,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-11 01:43:58,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:43:58,773 INFO L225 Difference]: With dead ends: 40 [2024-10-11 01:43:58,773 INFO L226 Difference]: Without dead ends: 26 [2024-10-11 01:43:58,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:43:58,774 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:43:58,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 52 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:43:58,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-11 01:43:58,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-10-11 01:43:58,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:43:58,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2024-10-11 01:43:58,783 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 12 [2024-10-11 01:43:58,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:43:58,783 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2024-10-11 01:43:58,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:43:58,784 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2024-10-11 01:43:58,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 01:43:58,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:43:58,785 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:43:58,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 01:43:58,785 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:43:58,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:43:58,786 INFO L85 PathProgramCache]: Analyzing trace with hash 815803536, now seen corresponding path program 1 times [2024-10-11 01:43:58,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:43:58,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983815786] [2024-10-11 01:43:58,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:43:58,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:43:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:58,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:43:58,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:58,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:43:58,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:58,959 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 01:43:58,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:43:58,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983815786] [2024-10-11 01:43:58,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983815786] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:43:58,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478895499] [2024-10-11 01:43:58,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:43:58,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:43:58,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:43:58,963 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:43:58,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 01:43:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:59,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 01:43:59,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:43:59,154 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 01:43:59,154 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 01:43:59,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478895499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:43:59,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 01:43:59,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-10-11 01:43:59,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548714209] [2024-10-11 01:43:59,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:43:59,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 01:43:59,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:43:59,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 01:43:59,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 01:43:59,158 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 01:43:59,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:43:59,185 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2024-10-11 01:43:59,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 01:43:59,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-10-11 01:43:59,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:43:59,187 INFO L225 Difference]: With dead ends: 37 [2024-10-11 01:43:59,187 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 01:43:59,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 01:43:59,189 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 24 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:43:59,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 48 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:43:59,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 01:43:59,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2024-10-11 01:43:59,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:43:59,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2024-10-11 01:43:59,198 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 18 [2024-10-11 01:43:59,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:43:59,198 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-10-11 01:43:59,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 01:43:59,198 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2024-10-11 01:43:59,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 01:43:59,199 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:43:59,199 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:43:59,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 01:43:59,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:43:59,400 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:43:59,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:43:59,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1293093265, now seen corresponding path program 1 times [2024-10-11 01:43:59,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:43:59,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230271462] [2024-10-11 01:43:59,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:43:59,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:43:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:59,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:43:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:59,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:43:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:59,622 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 01:43:59,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:43:59,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230271462] [2024-10-11 01:43:59,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230271462] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:43:59,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914005146] [2024-10-11 01:43:59,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:43:59,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:43:59,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:43:59,625 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:43:59,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 01:43:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:59,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 01:43:59,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:43:59,824 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 01:43:59,826 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:43:59,891 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 01:43:59,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914005146] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:43:59,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:43:59,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2024-10-11 01:43:59,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195957701] [2024-10-11 01:43:59,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:43:59,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 01:43:59,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:43:59,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 01:43:59,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 01:43:59,893 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 01:44:00,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:44:00,060 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2024-10-11 01:44:00,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 01:44:00,061 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 24 [2024-10-11 01:44:00,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:44:00,062 INFO L225 Difference]: With dead ends: 48 [2024-10-11 01:44:00,062 INFO L226 Difference]: Without dead ends: 44 [2024-10-11 01:44:00,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-11 01:44:00,063 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 46 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:44:00,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 103 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:44:00,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-11 01:44:00,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2024-10-11 01:44:00,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:44:00,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2024-10-11 01:44:00,070 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 24 [2024-10-11 01:44:00,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:44:00,070 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-10-11 01:44:00,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 01:44:00,071 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2024-10-11 01:44:00,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 01:44:00,072 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:44:00,072 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:44:00,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 01:44:00,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:00,272 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:44:00,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:44:00,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1038982702, now seen corresponding path program 2 times [2024-10-11 01:44:00,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:44:00,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040281711] [2024-10-11 01:44:00,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:00,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:44:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:00,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:44:00,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:00,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:44:00,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:00,492 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 01:44:00,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:44:00,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040281711] [2024-10-11 01:44:00,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040281711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:44:00,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:44:00,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 01:44:00,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064706779] [2024-10-11 01:44:00,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:44:00,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 01:44:00,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:44:00,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 01:44:00,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:44:00,493 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 01:44:00,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:44:00,601 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2024-10-11 01:44:00,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 01:44:00,602 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-10-11 01:44:00,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:44:00,603 INFO L225 Difference]: With dead ends: 49 [2024-10-11 01:44:00,603 INFO L226 Difference]: Without dead ends: 34 [2024-10-11 01:44:00,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 01:44:00,604 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 15 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:44:00,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 83 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:44:00,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-11 01:44:00,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-11 01:44:00,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:44:00,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2024-10-11 01:44:00,608 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 30 [2024-10-11 01:44:00,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:44:00,608 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2024-10-11 01:44:00,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 01:44:00,608 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2024-10-11 01:44:00,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 01:44:00,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:44:00,609 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:44:00,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 01:44:00,609 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:44:00,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:44:00,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1906109968, now seen corresponding path program 1 times [2024-10-11 01:44:00,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:44:00,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106720516] [2024-10-11 01:44:00,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:00,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:44:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:00,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:44:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:00,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:44:00,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:00,708 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 01:44:00,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:44:00,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106720516] [2024-10-11 01:44:00,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106720516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:44:00,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:44:00,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 01:44:00,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716718317] [2024-10-11 01:44:00,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:44:00,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 01:44:00,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:44:00,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 01:44:00,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 01:44:00,710 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 01:44:00,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:44:00,766 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2024-10-11 01:44:00,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 01:44:00,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2024-10-11 01:44:00,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:44:00,766 INFO L225 Difference]: With dead ends: 60 [2024-10-11 01:44:00,766 INFO L226 Difference]: Without dead ends: 38 [2024-10-11 01:44:00,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:44:00,767 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:44:00,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 59 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:44:00,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-11 01:44:00,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-11 01:44:00,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:44:00,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-10-11 01:44:00,774 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 36 [2024-10-11 01:44:00,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:44:00,775 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-10-11 01:44:00,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 01:44:00,775 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-10-11 01:44:00,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 01:44:00,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:44:00,776 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:44:00,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 01:44:00,777 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:44:00,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:44:00,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1465101296, now seen corresponding path program 1 times [2024-10-11 01:44:00,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:44:00,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977796909] [2024-10-11 01:44:00,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:00,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:44:00,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:01,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:44:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:01,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:44:01,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:01,248 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 01:44:01,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:44:01,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977796909] [2024-10-11 01:44:01,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977796909] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:44:01,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478412535] [2024-10-11 01:44:01,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:01,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:01,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:44:01,254 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:44:01,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 01:44:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:01,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-10-11 01:44:01,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:44:01,873 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 23 treesize of output 15 [2024-10-11 01:44:01,879 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 19 treesize of output 11 [2024-10-11 01:44:02,008 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:44:02,009 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:44:02,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 11 [2024-10-11 01:44:02,067 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:44:02,068 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:44:02,075 INFO L349 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2024-10-11 01:44:02,075 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 13 [2024-10-11 01:44:02,167 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 01:44:02,209 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 01:44:02,210 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:44:02,401 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 243 treesize of output 219 [2024-10-11 01:44:02,507 INFO L349 Elim1Store]: treesize reduction 38, result has 78.8 percent of original size [2024-10-11 01:44:02,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 553 treesize of output 581 [2024-10-11 01:44:03,637 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 01:44:03,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478412535] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:44:03,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:44:03,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 17, 10] total 31 [2024-10-11 01:44:03,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797166911] [2024-10-11 01:44:03,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:44:03,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-11 01:44:03,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:44:03,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-11 01:44:03,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2024-10-11 01:44:03,645 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 31 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 28 states have internal predecessors, (76), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 01:44:03,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:44:03,871 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2024-10-11 01:44:03,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 01:44:03,871 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 28 states have internal predecessors, (76), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 40 [2024-10-11 01:44:03,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:44:03,872 INFO L225 Difference]: With dead ends: 66 [2024-10-11 01:44:03,872 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 01:44:03,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=155, Invalid=837, Unknown=0, NotChecked=0, Total=992 [2024-10-11 01:44:03,873 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 22 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 01:44:03,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 162 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 01:44:03,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 01:44:03,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2024-10-11 01:44:03,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:44:03,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2024-10-11 01:44:03,887 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 40 [2024-10-11 01:44:03,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:44:03,891 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2024-10-11 01:44:03,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 28 states have internal predecessors, (76), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 01:44:03,892 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2024-10-11 01:44:03,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 01:44:03,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:44:03,892 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:44:03,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 01:44:04,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:04,094 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:44:04,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:44:04,098 INFO L85 PathProgramCache]: Analyzing trace with hash 721078123, now seen corresponding path program 1 times [2024-10-11 01:44:04,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:44:04,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918534159] [2024-10-11 01:44:04,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:04,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:44:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:04,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:44:04,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:04,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:44:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:04,284 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 01:44:04,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:44:04,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918534159] [2024-10-11 01:44:04,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918534159] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:44:04,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124362803] [2024-10-11 01:44:04,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:04,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:04,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:44:04,288 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:44:04,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 01:44:04,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:04,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-11 01:44:04,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:44:04,692 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2024-10-11 01:44:04,719 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 01:44:04,720 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:44:04,897 INFO L349 Elim1Store]: treesize reduction 4, result has 78.9 percent of original size [2024-10-11 01:44:04,898 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 51 treesize of output 51 [2024-10-11 01:44:04,915 INFO L349 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2024-10-11 01:44:04,919 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 35 [2024-10-11 01:44:04,944 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 01:44:04,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124362803] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:44:04,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:44:04,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 8] total 23 [2024-10-11 01:44:04,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054682977] [2024-10-11 01:44:04,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:44:04,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 01:44:04,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:44:04,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 01:44:04,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2024-10-11 01:44:04,946 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 23 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 01:44:05,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:44:05,177 INFO L93 Difference]: Finished difference Result 84 states and 99 transitions. [2024-10-11 01:44:05,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 01:44:05,178 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2024-10-11 01:44:05,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:44:05,178 INFO L225 Difference]: With dead ends: 84 [2024-10-11 01:44:05,178 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 01:44:05,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2024-10-11 01:44:05,179 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 19 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 01:44:05,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 218 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 01:44:05,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 01:44:05,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2024-10-11 01:44:05,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.163265306122449) internal successors, (57), 49 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:44:05,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2024-10-11 01:44:05,185 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 42 [2024-10-11 01:44:05,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:44:05,186 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2024-10-11 01:44:05,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 01:44:05,186 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2024-10-11 01:44:05,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 01:44:05,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:44:05,187 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:44:05,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 01:44:05,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-11 01:44:05,391 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:44:05,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:44:05,391 INFO L85 PathProgramCache]: Analyzing trace with hash 336492294, now seen corresponding path program 2 times [2024-10-11 01:44:05,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:44:05,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93043150] [2024-10-11 01:44:05,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:05,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:44:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:06,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:44:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:06,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:44:06,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:06,156 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 01:44:06,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:44:06,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93043150] [2024-10-11 01:44:06,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93043150] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:44:06,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507868175] [2024-10-11 01:44:06,157 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 01:44:06,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:06,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:44:06,159 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:44:06,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 01:44:06,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 01:44:06,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 01:44:06,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 113 conjuncts are in the unsatisfiable core [2024-10-11 01:44:06,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:44:06,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 01:44:06,408 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 18 treesize of output 7 [2024-10-11 01:44:06,618 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 01:44:06,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 01:44:06,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 01:44:06,744 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 19 treesize of output 18 [2024-10-11 01:44:06,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 01:44:06,833 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-10-11 01:44:06,833 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 90 treesize of output 52 [2024-10-11 01:44:06,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 33 [2024-10-11 01:44:07,089 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:44:07,090 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:44:07,091 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:44:07,096 INFO L349 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2024-10-11 01:44:07,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 113 treesize of output 54 [2024-10-11 01:44:07,385 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 01:44:07,386 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:44:07,659 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 252 treesize of output 212 [2024-10-11 01:44:07,661 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 216 treesize of output 172 [2024-10-11 01:44:07,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:44:07,743 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 2750 treesize of output 2566 [2024-10-11 01:44:08,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:44:08,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 993 treesize of output 790 [2024-10-11 01:44:09,102 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse5 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (and (or (and (forall ((|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| Int)) (or (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20|) 0)) (forall ((v_prenex_2 Int) (v_arrayElimArr_1 (Array Int Int))) (or (not (= (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| v_arrayElimArr_1))) (store .cse1 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (select (select .cse0 v_prenex_2) (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (select (select .cse0 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20|) 0)))) 0)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| v_prenex_2) (not (= (select v_arrayElimArr_1 0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) (or (forall ((v_arrayElimCell_29 Int) (v_arrayElimArr_1 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| Int)) (or (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| v_arrayElimCell_29) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20|) 0)) (not (= (select v_arrayElimArr_1 0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| v_arrayElimArr_1))) (store .cse3 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (select (select .cse2 v_arrayElimCell_29) (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (select (select .cse2 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20|) 0)))) 0)))) .cse4)) .cse5) (or (forall ((v_arrayElimCell_30 Int) (v_arrayElimArr_1 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| Int)) (let ((.cse6 (let ((.cse8 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| v_arrayElimArr_1))) (store .cse8 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse8 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (select (select .cse6 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20|) 0)))) (or (not (= (select (select .cse6 v_arrayElimCell_30) .cse7) 0)) (= .cse7 0) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20|) 0)) (not (= (select v_arrayElimArr_1 0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) .cse4) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (forall ((v_arrayElimCell_30 Int) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| Int)) (let ((.cse9 (let ((.cse11 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| v_arrayElimArr_1))) (store .cse11 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse11 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (select (select .cse9 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20|) 0)))) (or (not (= (select (select .cse9 v_arrayElimCell_30) .cse10) 0)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= .cse10 0) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20|) 0)))))) (not (= (select v_arrayElimArr_1 0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20|) 0)) (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse13 (let ((.cse15 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| v_arrayElimArr_1))) (store .cse15 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse15 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (let ((.cse12 (select (select .cse13 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20|) 0)) (.cse14 (select v_arrayElimArr_1 0))) (or (= .cse12 0) (forall ((v_prenex_1 Int)) (or (not (= (select (select .cse13 v_prenex_1) (select (select .cse13 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse12)) 0)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| v_prenex_1))) (= .cse14 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (not (= .cse14 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))))) (forall ((|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| Int)) (or (forall ((v_prenex_4 Int)) (or (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse16 (select v_arrayElimArr_1 0))) (or (= .cse16 0) (= .cse16 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (not (= (let ((.cse17 (let ((.cse18 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| v_arrayElimArr_1))) (store .cse18 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse18 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (select (select .cse17 v_prenex_4) (select (select .cse17 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (select (select .cse17 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20|) 0)))) 0)) (not (= .cse16 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| v_prenex_4))) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20|) 0)))) (or (forall ((v_prenex_4 Int) (v_arrayElimArr_1 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| Int)) (let ((.cse19 (select v_arrayElimArr_1 0))) (or (= .cse19 0) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= (let ((.cse20 (let ((.cse21 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| v_arrayElimArr_1))) (store .cse21 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse21 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (select (select .cse20 v_prenex_4) (select (select .cse20 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (select (select .cse20 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20|) 0)))) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20|) 0)) (not (= .cse19 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| v_prenex_4)))) .cse5) (forall ((|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| Int)) (or (forall ((v_prenex_4 Int)) (or (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse22 (select v_arrayElimArr_1 0))) (or (= .cse22 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (not (= (let ((.cse23 (let ((.cse24 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| v_arrayElimArr_1))) (store .cse24 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse24 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (select (select .cse23 v_prenex_4) (select (select .cse23 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (select (select .cse23 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20|) 0)))) 0)) (not (= .cse22 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| v_prenex_4))) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20|) 0)))) (or (forall ((v_arrayElimCell_29 Int) (v_arrayElimArr_1 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| Int)) (let ((.cse25 (select v_arrayElimArr_1 0))) (or (= .cse25 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| v_arrayElimCell_29) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20|) 0)) (not (= .cse25 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= (let ((.cse26 (let ((.cse27 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| v_arrayElimArr_1))) (store .cse27 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse27 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (select (select .cse26 v_arrayElimCell_29) (select (select .cse26 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (select (select .cse26 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20|) 0)))) 0))))) .cse4) (forall ((|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| Int)) (or (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_prenex_2 Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse28 (select v_arrayElimArr_1 0))) (or (= .cse28 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (not (= (let ((.cse29 (let ((.cse30 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| v_arrayElimArr_1))) (store .cse30 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse30 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (select (select .cse29 v_prenex_2) (select (select .cse29 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (select (select .cse29 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20|) 0)))) 0)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| v_prenex_2) (not (= .cse28 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20|) 0)))) (or (forall ((v_arrayElimArr_1 (Array Int Int)) (v_prenex_3 Int) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| Int)) (let ((.cse31 (let ((.cse33 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| v_arrayElimArr_1))) (store .cse33 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse33 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (let ((.cse32 (select (select .cse31 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (select (select .cse31 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20|) 0)))) (or (not (= (select (select .cse31 v_prenex_3) .cse32) 0)) (= .cse32 0) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20|) 0)) (not (= (select v_arrayElimArr_1 0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) .cse4) (or (and (forall ((|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| Int)) (or (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse36 (select v_arrayElimArr_1 0))) (or (forall ((v_prenex_1 Int)) (or (not (= (let ((.cse34 (let ((.cse35 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| v_arrayElimArr_1))) (store .cse35 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse35 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (select (select .cse34 v_prenex_1) (select (select .cse34 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (select (select .cse34 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20|) 0)))) 0)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| v_prenex_1))) (= .cse36 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (not (= .cse36 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20|) 0)))) (or (forall ((v_prenex_5 Int) (v_arrayElimArr_1 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| Int)) (or (not (= (let ((.cse37 (let ((.cse38 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| v_arrayElimArr_1))) (store .cse38 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse38 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (select (select .cse37 v_prenex_5) (select (select .cse37 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) 0)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| v_prenex_5) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20|) 0)) (not (= (select v_arrayElimArr_1 0) 0)))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)))) .cse4) (or (forall ((v_prenex_4 Int) (v_arrayElimArr_1 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| Int)) (or (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= (let ((.cse39 (let ((.cse40 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| v_arrayElimArr_1))) (store .cse40 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse40 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (select (select .cse39 v_prenex_4) (select (select .cse39 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (select (select .cse39 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20|) 0)))) 0)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20|) 0)) (not (= (select v_arrayElimArr_1 0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| v_prenex_4))) .cse5) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (forall ((v_prenex_3 Int) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| Int)) (let ((.cse41 (let ((.cse43 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| v_arrayElimArr_1))) (store .cse43 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse43 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (let ((.cse42 (select (select .cse41 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (select (select .cse41 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20|) 0)))) (or (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= (select (select .cse41 v_prenex_3) .cse42) 0)) (= .cse42 0) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20|) 0)))))) (not (= (select v_arrayElimArr_1 0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (or .cse4 (and (forall ((|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| Int)) (or (forall ((v_prenex_6 Int)) (or (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| v_prenex_6) (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse46 (select v_arrayElimArr_1 0))) (or (not (= (let ((.cse44 (let ((.cse45 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| v_arrayElimArr_1))) (store .cse45 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse45 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (select (select .cse44 v_prenex_6) (select (select .cse44 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (select (select .cse44 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20|) 0)))) 0)) (= .cse46 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (not (= .cse46 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20|) 0)))) (or (forall ((v_prenex_6 Int) (v_arrayElimArr_1 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| Int)) (or (not (= (let ((.cse47 (let ((.cse48 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| v_arrayElimArr_1))) (store .cse48 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse48 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (select (select .cse47 v_prenex_6) (select (select .cse47 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (select (select .cse47 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20|) 0)))) 0)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| v_prenex_6) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20|) 0)) (not (= (select v_arrayElimArr_1 0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) .cse5) (forall ((|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| Int)) (or (forall ((v_prenex_6 Int)) (or (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| v_prenex_6) (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse49 (select v_arrayElimArr_1 0))) (or (= .cse49 0) (not (= (let ((.cse50 (let ((.cse51 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| v_arrayElimArr_1))) (store .cse51 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse51 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (select (select .cse50 v_prenex_6) (select (select .cse50 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (select (select .cse50 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20|) 0)))) 0)) (= .cse49 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (not (= .cse49 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20|) 0)))) (or (forall ((v_prenex_6 Int) (v_arrayElimArr_1 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| Int)) (let ((.cse52 (select v_arrayElimArr_1 0))) (or (= .cse52 0) (not (= (let ((.cse53 (let ((.cse54 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| v_arrayElimArr_1))) (store .cse54 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse54 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (select (select .cse53 v_prenex_6) (select (select .cse53 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (select (select .cse53 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20|) 0)))) 0)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20| v_prenex_6) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_20|) 0)) (not (= .cse52 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) .cse5))))) is different from false [2024-10-11 01:44:09,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507868175] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:44:09,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 01:44:09,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 32 [2024-10-11 01:44:09,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72251347] [2024-10-11 01:44:09,130 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 01:44:09,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-11 01:44:09,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:44:09,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-11 01:44:09,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1502, Unknown=1, NotChecked=78, Total=1722 [2024-10-11 01:44:09,132 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 32 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 26 states have internal predecessors, (51), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 01:44:09,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:44:09,527 INFO L93 Difference]: Finished difference Result 109 states and 128 transitions. [2024-10-11 01:44:09,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 01:44:09,529 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 26 states have internal predecessors, (51), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 44 [2024-10-11 01:44:09,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:44:09,531 INFO L225 Difference]: With dead ends: 109 [2024-10-11 01:44:09,531 INFO L226 Difference]: Without dead ends: 74 [2024-10-11 01:44:09,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=169, Invalid=1726, Unknown=1, NotChecked=84, Total=1980 [2024-10-11 01:44:09,532 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 44 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 01:44:09,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 171 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 01:44:09,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-11 01:44:09,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 66. [2024-10-11 01:44:09,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 61 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 01:44:09,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2024-10-11 01:44:09,551 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 44 [2024-10-11 01:44:09,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:44:09,552 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2024-10-11 01:44:09,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 26 states have internal predecessors, (51), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 01:44:09,552 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2024-10-11 01:44:09,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 01:44:09,553 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:44:09,553 INFO L215 NwaCegarLoop]: trace histogram [6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:44:09,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 01:44:09,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:09,758 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:44:09,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:44:09,758 INFO L85 PathProgramCache]: Analyzing trace with hash 116698081, now seen corresponding path program 3 times [2024-10-11 01:44:09,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:44:09,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989818122] [2024-10-11 01:44:09,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:09,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:44:09,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:10,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:44:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:10,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:44:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:10,241 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 24 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 01:44:10,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:44:10,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989818122] [2024-10-11 01:44:10,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989818122] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:44:10,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875995268] [2024-10-11 01:44:10,242 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 01:44:10,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:10,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:44:10,243 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:44:10,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 01:44:10,578 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-11 01:44:10,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 01:44:10,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 126 conjuncts are in the unsatisfiable core [2024-10-11 01:44:10,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:44:10,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 01:44:10,808 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 01:44:10,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 01:44:10,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 01:44:10,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 01:44:10,909 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-10-11 01:44:10,910 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 75 treesize of output 45 [2024-10-11 01:44:10,914 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 39 treesize of output 30 [2024-10-11 01:44:11,533 INFO L349 Elim1Store]: treesize reduction 28, result has 31.7 percent of original size [2024-10-11 01:44:11,533 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 49 [2024-10-11 01:44:11,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-10-11 01:44:11,583 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 01:44:11,583 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:44:11,781 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 188 treesize of output 152 [2024-10-11 01:44:11,783 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 156 treesize of output 124 [2024-10-11 01:44:11,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:44:11,854 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 2504 treesize of output 2384 [2024-10-11 01:44:12,916 INFO L349 Elim1Store]: treesize reduction 932, result has 30.8 percent of original size [2024-10-11 01:44:12,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 20 new quantified variables, introduced 136 case distinctions, treesize of input 18176 treesize of output 16746 [2024-10-11 01:44:44,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875995268] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:44:44,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 01:44:44,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 32 [2024-10-11 01:44:44,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197388880] [2024-10-11 01:44:44,139 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 01:44:44,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-11 01:44:44,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:44:44,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-11 01:44:44,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1404, Unknown=0, NotChecked=0, Total=1560 [2024-10-11 01:44:44,143 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 32 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 28 states have internal predecessors, (60), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 01:44:45,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:44:45,432 INFO L93 Difference]: Finished difference Result 141 states and 171 transitions. [2024-10-11 01:44:45,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-11 01:44:45,432 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 28 states have internal predecessors, (60), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 46 [2024-10-11 01:44:45,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:44:45,434 INFO L225 Difference]: With dead ends: 141 [2024-10-11 01:44:45,434 INFO L226 Difference]: Without dead ends: 112 [2024-10-11 01:44:45,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=402, Invalid=3020, Unknown=0, NotChecked=0, Total=3422 [2024-10-11 01:44:45,435 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 86 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 01:44:45,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 231 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 01:44:45,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-11 01:44:45,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 92. [2024-10-11 01:44:45,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 87 states have (on average 1.1839080459770115) internal successors, (103), 87 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 01:44:45,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 109 transitions. [2024-10-11 01:44:45,452 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 109 transitions. Word has length 46 [2024-10-11 01:44:45,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:44:45,453 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 109 transitions. [2024-10-11 01:44:45,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 28 states have internal predecessors, (60), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 01:44:45,453 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 109 transitions. [2024-10-11 01:44:45,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 01:44:45,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:44:45,454 INFO L215 NwaCegarLoop]: trace histogram [6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:44:45,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 01:44:45,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 01:44:45,655 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:44:45,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:44:45,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1985711900, now seen corresponding path program 4 times [2024-10-11 01:44:45,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:44:45,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662204161] [2024-10-11 01:44:45,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:45,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:44:45,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:46,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:44:46,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:46,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:44:46,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:46,354 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 01:44:46,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:44:46,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662204161] [2024-10-11 01:44:46,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662204161] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:44:46,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391087096] [2024-10-11 01:44:46,354 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 01:44:46,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:46,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:44:46,356 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:44:46,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 01:44:46,551 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 01:44:46,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 01:44:46,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 122 conjuncts are in the unsatisfiable core [2024-10-11 01:44:46,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:44:46,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 01:44:46,580 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 18 treesize of output 7 [2024-10-11 01:44:46,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-10-11 01:44:46,751 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 01:44:46,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-10-11 01:44:46,762 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 01:44:46,763 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 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 01:44:46,804 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 19 treesize of output 18 [2024-10-11 01:44:46,810 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 19 treesize of output 11 [2024-10-11 01:44:46,866 INFO L349 Elim1Store]: treesize reduction 36, result has 35.7 percent of original size [2024-10-11 01:44:46,866 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 74 treesize of output 48 [2024-10-11 01:44:46,872 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 39 treesize of output 30 [2024-10-11 01:44:47,137 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-10-11 01:44:47,137 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:44:47,428 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 148 treesize of output 120 [2024-10-11 01:44:47,432 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 188 treesize of output 160 [2024-10-11 01:44:47,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:44:47,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 405 treesize of output 352 [2024-10-11 01:44:47,963 INFO L349 Elim1Store]: treesize reduction 289, result has 66.5 percent of original size [2024-10-11 01:44:47,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 27078 treesize of output 23761 [2024-10-11 01:45:13,427 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 12 treesize of output 8 [2024-10-11 01:45:13,901 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 6 treesize of output 4 [2024-10-11 01:45:19,265 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse118 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) (.cse8 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse10 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))) (let ((.cse39 (forall ((|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (forall ((v_arrayElimArr_2 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int)) (let ((.cse168 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (let ((.cse167 (select (select .cse168 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|))) (or (not (= .cse167 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select .cse168 .cse167) 0)) (= |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| 0) (= .cse167 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))))) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0)))) (.cse112 (or .cse10 (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int)) (let ((.cse166 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (let ((.cse165 (select (select .cse166 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (not (= .cse165 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select .cse166 .cse165) 0)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0) (= |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| 0))))))) (.cse40 (forall ((|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0) (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (forall ((|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int)) (let ((.cse163 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (let ((.cse164 (store (select .cse163 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|))) (let ((.cse162 (select .cse164 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|))) (or (not (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| .cse162)) (= (select (select (store .cse163 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse164) .cse162) 0) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))))))))))) (.cse122 (forall ((|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (forall ((v_arrayElimArr_2 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int)) (or (forall ((|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int)) (let ((.cse161 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (let ((.cse160 (select (select .cse161 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|))) (or (not (= .cse160 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select .cse161 .cse160) 0)) (= .cse160 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))))) (= |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| 4) (= |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| 0))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))))) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0)))) (.cse123 (or .cse10 (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int)) (let ((.cse159 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (let ((.cse158 (select (select .cse159 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (not (= .cse158 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select .cse159 .cse158) 0)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0) (= |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| 4) (= |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| 0))))))) (.cse41 (forall ((|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (forall ((|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int)) (let ((.cse157 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (let ((.cse156 (select (select .cse157 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|))) (or (not (= .cse156 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select .cse157 .cse156) 0)) (= |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| (select (select .cse157 (select (select (store .cse157 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse157 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|)) 0)) (= .cse156 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0)))) (.cse126 (or .cse8 (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int)) (let ((.cse155 (select (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (not (= .cse155 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0) (= |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| 0) (= .cse155 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)))))) (.cse116 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 4)) (.cse115 (not .cse118)) (.cse42 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0))) (and (forall ((|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (forall ((v_arrayElimArr_2 (Array Int Int))) (or (forall ((v_prenex_66 Int)) (or (= v_prenex_66 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= v_prenex_66 0) (forall ((|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int) (v_prenex_65 Int)) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (let ((.cse1 (select (select .cse3 v_prenex_65) v_prenex_66)) (.cse0 (store .cse3 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)))) (or (= (select (select .cse0 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|) v_prenex_65) (not (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| .cse1)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse1) (let ((.cse2 (select (select .cse0 v_prenex_65) v_prenex_66))) (= .cse2 (select (select .cse0 (select (select .cse0 .cse2) 0)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))))) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0))) (forall ((|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (forall ((|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int) (v_prenex_65 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (let ((.cse6 (store .cse7 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)))) (or (forall ((v_prenex_66 Int)) (let ((.cse4 (select (select .cse7 v_prenex_65) v_prenex_66))) (or (not (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| .cse4)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse4) (= v_prenex_66 0) (let ((.cse5 (select (select .cse6 v_prenex_65) v_prenex_66))) (= .cse5 (select (select .cse6 (select (select .cse6 .cse5) 0)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) (= (select (select .cse6 (select (select .cse6 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|)) 0) v_prenex_65))))))) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0))) (or .cse8 (and (forall ((v_arrayElimArr_2 (Array Int Int))) (let ((.cse9 (select v_arrayElimArr_2 0))) (or (forall ((|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| (select (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2) .cse9) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse9))))) (or .cse10 (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int)) (let ((.cse11 (select v_arrayElimArr_2 0))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse11)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| (select (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2) .cse11) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0))))))) (or .cse10 (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int) (v_prenex_66 Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int) (v_prenex_65 Int)) (let ((.cse13 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (let ((.cse12 (store .cse13 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse13 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)))) (or (= (select (select .cse12 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|) v_prenex_65) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (= v_prenex_66 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| (select (select .cse13 v_prenex_65) v_prenex_66))) (= v_prenex_66 0) (let ((.cse14 (select (select .cse12 v_prenex_65) v_prenex_66))) (= .cse14 (select (select .cse12 (select (select .cse12 .cse14) 0)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0)))))) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int) (v_prenex_66 Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int) (v_prenex_65 Int)) (let ((.cse16 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse16 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)))) (or (= (select (select .cse15 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|) v_prenex_65) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_prenex_65) (= v_prenex_66 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| (select (select .cse16 v_prenex_65) v_prenex_66))) (let ((.cse17 (select (select .cse15 v_prenex_65) v_prenex_66))) (= .cse17 (select (select .cse15 (select (select .cse15 .cse17) 0)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0))))) .cse10) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int) (v_prenex_66 Int) (v_prenex_65 Int)) (let ((.cse18 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_prenex_65) (= v_prenex_66 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| (select (select .cse18 v_prenex_65) v_prenex_66))) (let ((.cse20 (store .cse18 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse18 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)))) (let ((.cse19 (select (select .cse20 v_prenex_65) v_prenex_66))) (= .cse19 (select (select .cse20 (select (select .cse20 .cse19) 0)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0)))) .cse10) (forall ((|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0) (forall ((v_arrayElimArr_2 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int) (v_prenex_65 Int)) (let ((.cse22 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (let ((.cse21 (store .cse22 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse22 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)))) (or (= (select (select .cse21 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|) v_prenex_65) (forall ((v_prenex_66 Int)) (let ((.cse23 (select (select .cse21 v_prenex_65) v_prenex_66))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select .cse22 v_prenex_65) v_prenex_66)) (= v_prenex_66 0) (= .cse23 (select (select .cse21 (select (select .cse21 .cse23) 0)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= .cse23 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|))))))))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))))))) (forall ((|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0) (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (forall ((|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int) (v_prenex_65 Int)) (let ((.cse27 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (let ((.cse26 (store .cse27 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse27 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)))) (or (forall ((v_prenex_66 Int)) (let ((.cse24 (select (select .cse27 v_prenex_65) v_prenex_66))) (or (not (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| .cse24)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse24) (let ((.cse25 (select (select .cse26 v_prenex_65) v_prenex_66))) (= .cse25 (select (select .cse26 (select (select .cse26 .cse25) 0)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_prenex_65) (= (select (select .cse26 (select (select .cse26 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|)) 0) v_prenex_65))))))))) (or .cse8 (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int)) (let ((.cse29 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (let ((.cse28 (select (select .cse29 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (not (= .cse28 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)) (= |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| (select (select .cse29 (select (select (store .cse29 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse29 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|)) 0)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| (select (select .cse29 .cse28) 0)) (= .cse28 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)))))) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int) (v_prenex_66 Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int) (v_prenex_65 Int)) (let ((.cse30 (let ((.cse32 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (store .cse32 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse32 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|))))) (let ((.cse31 (select (select .cse30 v_prenex_65) v_prenex_66))) (or (= (select (select .cse30 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|) v_prenex_65) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_prenex_65) (= .cse31 (select (select .cse30 (select (select .cse30 .cse31) 0)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= .cse31 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0))))) .cse10) (or .cse10 (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int) (v_prenex_66 Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int) (v_prenex_65 Int)) (let ((.cse34 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (let ((.cse36 (store .cse34 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse34 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)))) (let ((.cse33 (select (select .cse36 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|)) (.cse35 (select (select .cse36 v_prenex_65) v_prenex_66))) (or (= .cse33 v_prenex_65) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_prenex_65) (= v_prenex_65 (select (select .cse34 .cse33) 0)) (= .cse35 (select (select .cse36 (select (select .cse36 .cse35) 0)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= .cse35 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0))))))) (forall ((|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0) (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int)) (let ((.cse38 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (let ((.cse37 (store .cse38 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse38 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)))) (or (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| (select (select .cse37 (select (select .cse37 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select .cse38 (select (select .cse37 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|)) 0)))))))) (or (and .cse39 .cse40 .cse41) .cse42) (forall ((|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (forall ((v_prenex_65 Int)) (or (forall ((v_prenex_66 Int)) (let ((.cse43 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (let ((.cse44 (select .cse43 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (let ((.cse46 (store .cse43 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store .cse44 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)))) (let ((.cse45 (select (select .cse46 v_prenex_65) v_prenex_66))) (or (= (select (select (store .cse43 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store .cse44 0 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)) v_prenex_65) v_prenex_66) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= .cse45 (select (select .cse46 (select (select .cse46 .cse45) 0)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= .cse45 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)))))))) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_prenex_65))))) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0))) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_prenex_66 Int) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int) (v_prenex_65 Int)) (let ((.cse47 (let ((.cse49 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (store .cse49 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse49 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|))))) (let ((.cse48 (select (select .cse47 v_prenex_65) v_prenex_66))) (or (= (select (select .cse47 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|) v_prenex_65) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (= v_prenex_66 0) (= .cse48 (select (select .cse47 (select (select .cse47 .cse48) 0)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= .cse48 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0))))) .cse10) (or .cse8 (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int)) (let ((.cse50 (let ((.cse52 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (store .cse52 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse52 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|))))) (let ((.cse51 (select (select .cse50 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (= (select (select .cse50 .cse51) 0) .cse51) (not (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| .cse51)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0) (= |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (forall ((v_arrayElimArr_2 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int) (v_prenex_65 Int)) (let ((.cse54 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (let ((.cse55 (select .cse54 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (let ((.cse57 (store .cse54 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store .cse55 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)))) (let ((.cse53 (select (select .cse57 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|))) (or (= .cse53 v_prenex_65) (forall ((v_prenex_66 Int)) (let ((.cse56 (select (select .cse57 v_prenex_65) v_prenex_66))) (or (= (select (select (store .cse54 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store .cse55 0 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)) v_prenex_65) v_prenex_66) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= .cse56 (select (select .cse57 (select (select .cse57 .cse56) 0)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= .cse56 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|))))) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_prenex_65) (= (select (select .cse57 .cse53) 0) v_prenex_65))))))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))))) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0))) (or .cse8 (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int)) (let ((.cse58 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (not (= (select (select .cse58 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|) |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)) (let ((.cse59 (store .cse58 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse58 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)))) (let ((.cse60 (select (select .cse59 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|))) (= (select (select .cse59 .cse60) 0) .cse60))) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0) (= |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| 0))))) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int) (v_prenex_66 Int) (v_prenex_65 Int)) (let ((.cse62 (let ((.cse63 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (store .cse63 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse63 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|))))) (let ((.cse61 (select (select .cse62 v_prenex_65) v_prenex_66))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_prenex_65) (= .cse61 (select (select .cse62 (select (select .cse62 .cse61) 0)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= .cse61 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0))))) .cse10) (forall ((|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (forall ((v_arrayElimArr_2 (Array Int Int))) (let ((.cse64 (select v_arrayElimArr_2 0))) (or (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse64)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| (select (select (let ((.cse65 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (store .cse65 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse65 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|))) |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse64)))) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0))) (forall ((v_arrayElimArr_2 (Array Int Int))) (let ((.cse66 (select v_arrayElimArr_2 4))) (or (not (= (select |c_#valid| .cse66) 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse66) (= (select (let ((.cse67 (let ((.cse68 (store |c_#memory_$Pointer$#2.base| .cse66 v_arrayElimArr_2))) (store .cse68 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse68 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| .cse66))))) (select .cse67 (select (select .cse67 .cse66) 0))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse66) (= .cse66 0)))) (forall ((|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (forall ((v_arrayElimArr_2 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int)) (let ((.cse71 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (let ((.cse69 (store .cse71 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse71 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)))) (let ((.cse70 (select (select .cse69 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|))) (or (= (select (select .cse69 .cse70) 0) .cse70) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select .cse71 (select (select .cse71 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|)) 0)) (not (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| .cse70)) (= |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))))) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0))) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int) (v_prenex_66 Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int) (v_prenex_65 Int)) (let ((.cse72 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (let ((.cse74 (store .cse72 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse72 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_prenex_65) (= v_prenex_66 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| (select (select .cse72 v_prenex_65) v_prenex_66))) (let ((.cse73 (select (select .cse74 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|))) (= .cse73 (select (select .cse72 .cse73) 0))) (let ((.cse75 (select (select .cse74 v_prenex_65) v_prenex_66))) (= .cse75 (select (select .cse74 (select (select .cse74 .cse75) 0)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0))))) .cse10) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_prenex_66 Int) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int) (v_prenex_65 Int)) (let ((.cse77 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (let ((.cse79 (store .cse77 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse77 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)))) (let ((.cse76 (select (select .cse79 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|)) (.cse78 (select (select .cse79 v_prenex_65) v_prenex_66))) (or (= .cse76 v_prenex_65) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (= v_prenex_65 (select (select .cse77 .cse76) 0)) (= v_prenex_66 0) (= .cse78 (select (select .cse79 (select (select .cse79 .cse78) 0)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= .cse78 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0)))))) .cse10) (or .cse8 (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int)) (let ((.cse80 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (let ((.cse81 (store .cse80 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse80 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)))) (let ((.cse82 (select (select .cse81 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (not (= (select (select .cse80 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|) |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)) (= (select (select .cse81 .cse82) 0) .cse82) (= |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| (select (select .cse80 .cse82) 0)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0))))))) (or (forall ((|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0))) .cse8 .cse10) (forall ((|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (forall ((v_prenex_66 Int)) (or (forall ((v_prenex_65 Int)) (let ((.cse83 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (let ((.cse84 (select .cse83 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (or (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_prenex_65) (not (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| (select (select .cse83 v_prenex_65) v_prenex_66))) (= (select (select (store .cse83 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store .cse84 0 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)) v_prenex_65) v_prenex_66) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (let ((.cse86 (store .cse83 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store .cse84 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)))) (let ((.cse85 (select (select .cse86 v_prenex_65) v_prenex_66))) (= .cse85 (select (select .cse86 (select (select .cse86 .cse85) 0)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))))) (= v_prenex_66 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0))) (forall ((|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0) (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (forall ((|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int) (v_prenex_65 Int)) (let ((.cse88 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (let ((.cse90 (store .cse88 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse88 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)))) (let ((.cse87 (select (select .cse90 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|))) (or (= .cse87 v_prenex_65) (forall ((v_prenex_66 Int)) (let ((.cse89 (select (select .cse90 v_prenex_65) v_prenex_66))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select .cse88 v_prenex_65) v_prenex_66)) (= v_prenex_66 0) (= .cse89 (select (select .cse90 (select (select .cse90 .cse89) 0)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= .cse89 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|))))) (= (select (select .cse90 .cse87) 0) v_prenex_65)))))))))) (or .cse10 (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int) (v_prenex_66 Int) (v_prenex_65 Int)) (let ((.cse91 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (= v_prenex_66 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| (select (select .cse91 v_prenex_65) v_prenex_66))) (= v_prenex_66 0) (let ((.cse93 (store .cse91 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse91 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)))) (let ((.cse92 (select (select .cse93 v_prenex_65) v_prenex_66))) (= .cse92 (select (select .cse93 (select (select .cse93 .cse92) 0)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0))))) (forall ((|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (forall ((v_prenex_66 Int)) (or (forall ((|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int) (v_prenex_65 Int)) (let ((.cse95 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (let ((.cse96 (select .cse95 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (let ((.cse94 (store .cse95 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store .cse96 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)))) (let ((.cse97 (select (select .cse94 v_prenex_65) v_prenex_66))) (or (= (select (select .cse94 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|) v_prenex_65) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_prenex_65) (= (select (select (store .cse95 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store .cse96 0 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)) v_prenex_65) v_prenex_66) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= .cse97 (select (select .cse94 (select (select .cse94 .cse97) 0)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= .cse97 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)))))))) (= v_prenex_66 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0))) (forall ((|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (forall ((|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int)) (let ((.cse101 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (let ((.cse98 (select (select .cse101 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|))) (or (not (= .cse98 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)) (let ((.cse99 (store .cse101 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse101 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)))) (let ((.cse100 (select (select .cse99 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|))) (= (select (select .cse99 .cse100) 0) .cse100))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select .cse101 .cse98) 0)) (= |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| 0))))))) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0))) (forall ((|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (forall ((v_prenex_66 Int)) (or (forall ((v_prenex_65 Int)) (let ((.cse102 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (let ((.cse104 (store .cse102 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse102 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)))) (let ((.cse103 (select (select .cse104 v_prenex_65) v_prenex_66))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select .cse102 v_prenex_65) v_prenex_66)) (= .cse103 (select (select .cse104 (select (select .cse104 .cse103) 0)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= .cse103 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|))))))) (= v_prenex_66 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0))) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int) (v_prenex_66 Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int) (v_prenex_65 Int)) (let ((.cse105 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (let ((.cse106 (store .cse105 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse105 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (not (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| (select (select .cse105 v_prenex_65) v_prenex_66))) (= v_prenex_65 (select (select .cse105 (select (select .cse106 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|)) 0)) (= v_prenex_66 0) (let ((.cse107 (select (select .cse106 v_prenex_65) v_prenex_66))) (= .cse107 (select (select .cse106 (select (select .cse106 .cse107) 0)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0))))) .cse10) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int)) (let ((.cse109 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (let ((.cse108 (select (select .cse109 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (not (= .cse108 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0) (= |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| 0) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| (select (select .cse109 .cse108) 0)) (= .cse108 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))))) .cse8) (or .cse42 (let ((.cse117 (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int)) (let ((.cse127 (select (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (not (= .cse127 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0) (= |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| 4) (= |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| 0) (= .cse127 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)))))) (and (or (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int)) (let ((.cse111 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (let ((.cse110 (select (select .cse111 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (not (= .cse110 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)) (= |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| (select (select .cse111 (select (select (store .cse111 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse111 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|)) 0)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0) (= .cse110 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))))) .cse8) .cse112 .cse40 (or (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int)) (let ((.cse114 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (let ((.cse113 (select (select .cse114 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (not (= .cse113 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select .cse114 .cse113) 0)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0) (= |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| 4) (= |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| 0) (= .cse113 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))))) .cse115) (or .cse116 .cse117 .cse115) (or .cse118 (forall ((v_arrayElimArr_2 (Array Int Int))) (let ((.cse119 (select v_arrayElimArr_2 4))) (or (not (= (select |c_#valid| .cse119) 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (= .cse119 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (let ((.cse120 (let ((.cse121 (store |c_#memory_$Pointer$#2.base| .cse119 v_arrayElimArr_2))) (store .cse121 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse121 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| .cse119))))) (select .cse120 (select (select .cse120 .cse119) 4))) 0)))))) (or (and .cse122 (or .cse116 .cse117) .cse123) .cse115) .cse41 (forall ((|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0) (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (forall ((|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int)) (or (forall ((|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int)) (let ((.cse125 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (let ((.cse124 (select (select .cse125 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|))) (or (not (= .cse124 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select .cse125 .cse124) 0)) (= .cse124 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))))) (= |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| 0))))))) .cse126))) (or (let ((.cse131 (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int)) (let ((.cse140 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (let ((.cse139 (select (select .cse140 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (not (= .cse139 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0) (not (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| (select (select .cse140 .cse139) 0))) (= |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| 4) (= |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| 0) (= .cse139 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))))))) (and (or .cse8 .cse10 (forall ((|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0)))) .cse39 .cse112 .cse40 (or .cse8 (and (forall ((|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (forall ((v_arrayElimArr_2 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int)) (let ((.cse129 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (let ((.cse128 (select (select .cse129 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|))) (or (not (= .cse128 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)) (= |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| (select (select .cse129 (select (select (store .cse129 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse129 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|)) 0)) (= .cse128 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))))) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0))) (or .cse10 (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int)) (let ((.cse130 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (not (= (select (select .cse130 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|) |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)) (= |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| (select (select .cse130 (select (select (store .cse130 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse130 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|)) 0)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0))))))) (or (and .cse122 .cse123 (or .cse116 .cse131)) .cse115) (or .cse8 (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int)) (let ((.cse132 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (not (= (select (select .cse132 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|) |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)) (let ((.cse133 (store .cse132 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse132 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)))) (let ((.cse134 (select (select .cse133 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|))) (= (select (select .cse133 .cse134) 0) .cse134))) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0) (= |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) (or .cse8 (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| (select (select (let ((.cse135 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (store .cse135 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse135 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|))) |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0)))) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int)) (let ((.cse137 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (let ((.cse136 (select (select .cse137 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (not (= .cse136 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select .cse137 .cse136) 0)) (= |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| (select (select .cse137 (select (select (store .cse137 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse137 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|)) 0)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0))))) .cse10) .cse41 .cse126 (or (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int)) (let ((.cse138 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select .cse138 (select (select .cse138 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|)) 0)) (not (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| (select (select (store .cse138 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse138 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|))) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0) (= |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| 0)))) .cse10) (or .cse116 .cse131 .cse115))) .cse42) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int) (v_prenex_66 Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int) (v_prenex_65 Int)) (let ((.cse141 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (let ((.cse142 (store .cse141 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse141 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_prenex_65) (not (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| (select (select .cse141 v_prenex_65) v_prenex_66))) (= v_prenex_65 (select (select .cse141 (select (select .cse142 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|)) 0)) (let ((.cse143 (select (select .cse142 v_prenex_65) v_prenex_66))) (= .cse143 (select (select .cse142 (select (select .cse142 .cse143) 0)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0))))) .cse10) (forall ((|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0) (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (forall ((|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56| Int) (v_prenex_65 Int)) (let ((.cse145 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (let ((.cse146 (select .cse145 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (let ((.cse144 (store .cse145 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store .cse146 |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)))) (or (= (select (select .cse144 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_54|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_56|) v_prenex_65) (forall ((v_prenex_66 Int)) (let ((.cse147 (select (select .cse144 v_prenex_65) v_prenex_66))) (or (= (select (select (store .cse145 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store .cse146 0 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)) v_prenex_65) v_prenex_66) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= .cse147 (select (select .cse144 (select (select .cse144 .cse147) 0)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= .cse147 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|))))) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_prenex_65)))))))))) (forall ((|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (forall ((v_arrayElimArr_2 (Array Int Int))) (or (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (forall ((v_prenex_66 Int)) (or (= v_prenex_66 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= v_prenex_66 0) (forall ((v_prenex_65 Int)) (let ((.cse151 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (let ((.cse148 (select (select .cse151 v_prenex_65) v_prenex_66))) (or (not (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| .cse148)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse148) (let ((.cse150 (store .cse151 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse151 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)))) (let ((.cse149 (select (select .cse150 v_prenex_65) v_prenex_66))) (= .cse149 (select (select .cse150 (select (select .cse150 .cse149) 0)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))))))))) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0))) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| Int) (v_prenex_66 Int) (v_prenex_65 Int)) (let ((.cse153 (let ((.cse154 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| v_arrayElimArr_2))) (store .cse154 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse154 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|))))) (let ((.cse152 (select (select .cse153 v_prenex_65) v_prenex_66))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|) 0)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select v_arrayElimArr_2 0))) (= v_prenex_66 0) (= .cse152 (select (select .cse153 (select (select .cse153 .cse152) 0)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= .cse152 |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28|)) (= |v_ULTIMATE.start_sll_circular_create_#t~ret5#1.base_28| 0))))) .cse10)))) is different from true [2024-10-11 01:45:19,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391087096] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:45:19,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 01:45:19,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2024-10-11 01:45:19,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287178408] [2024-10-11 01:45:19,277 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 01:45:19,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 01:45:19,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:45:19,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 01:45:19,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1146, Unknown=1, NotChecked=68, Total=1332 [2024-10-11 01:45:19,279 INFO L87 Difference]: Start difference. First operand 92 states and 109 transitions. Second operand has 28 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 22 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 01:45:19,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:45:19,614 INFO L93 Difference]: Finished difference Result 132 states and 157 transitions. [2024-10-11 01:45:19,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 01:45:19,614 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 22 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 48 [2024-10-11 01:45:19,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:45:19,615 INFO L225 Difference]: With dead ends: 132 [2024-10-11 01:45:19,615 INFO L226 Difference]: Without dead ends: 75 [2024-10-11 01:45:19,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=129, Invalid=1280, Unknown=1, NotChecked=72, Total=1482 [2024-10-11 01:45:19,616 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 01:45:19,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 220 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 01:45:19,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-11 01:45:19,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2024-10-11 01:45:19,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 69 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 01:45:19,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 88 transitions. [2024-10-11 01:45:19,624 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 88 transitions. Word has length 48 [2024-10-11 01:45:19,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:45:19,624 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 88 transitions. [2024-10-11 01:45:19,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 22 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 01:45:19,624 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 88 transitions. [2024-10-11 01:45:19,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 01:45:19,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:45:19,625 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:45:19,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 01:45:19,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:45:19,826 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:45:19,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:45:19,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1311629499, now seen corresponding path program 5 times [2024-10-11 01:45:19,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:45:19,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893976673] [2024-10-11 01:45:19,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:45:19,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:45:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:19,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:45:19,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:19,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:45:19,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:19,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 01:45:19,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:19,926 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-11 01:45:19,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:45:19,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893976673] [2024-10-11 01:45:19,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893976673] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:45:19,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569370598] [2024-10-11 01:45:19,927 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 01:45:19,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:45:19,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:45:19,930 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:45:19,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 01:45:20,140 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-10-11 01:45:20,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 01:45:20,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 01:45:20,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:45:20,164 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-11 01:45:20,164 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 01:45:20,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569370598] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:45:20,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 01:45:20,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-10-11 01:45:20,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178490669] [2024-10-11 01:45:20,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:45:20,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 01:45:20,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:45:20,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 01:45:20,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:45:20,165 INFO L87 Difference]: Start difference. First operand 74 states and 88 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 01:45:20,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:45:20,183 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2024-10-11 01:45:20,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 01:45:20,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2024-10-11 01:45:20,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:45:20,184 INFO L225 Difference]: With dead ends: 77 [2024-10-11 01:45:20,184 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 01:45:20,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:45:20,185 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:45:20,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:45:20,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 01:45:20,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 01:45:20,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:45:20,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 01:45:20,186 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2024-10-11 01:45:20,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:45:20,186 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 01:45:20,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 01:45:20,186 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 01:45:20,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 01:45:20,188 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 01:45:20,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 01:45:20,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 01:45:20,392 INFO L407 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1] [2024-10-11 01:45:20,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 01:45:20,887 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 01:45:20,907 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-10-11 01:45:20,908 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2024-10-11 01:45:20,908 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!base [2024-10-11 01:45:20,908 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-10-11 01:45:20,908 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-10-11 01:45:20,908 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-10-11 01:45:20,908 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-10-11 01:45:20,908 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-10-11 01:45:20,908 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-11 01:45:20,909 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-11 01:45:20,909 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-10-11 01:45:20,909 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!offset [2024-10-11 01:45:20,909 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-10-11 01:45:20,909 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-10-11 01:45:20,909 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-10-11 01:45:20,909 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2024-10-11 01:45:20,909 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!base [2024-10-11 01:45:20,909 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-10-11 01:45:20,909 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-10-11 01:45:20,909 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] [2024-10-11 01:45:20,910 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-10-11 01:45:20,910 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-10-11 01:45:20,910 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[0]]]]] [2024-10-11 01:45:20,910 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!offset [2024-10-11 01:45:20,910 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~1!base [2024-10-11 01:45:20,910 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-11 01:45:20,910 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-11 01:45:20,910 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]] [2024-10-11 01:45:20,910 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-11 01:45:20,910 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-11 01:45:20,910 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-10-11 01:45:20,910 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-10-11 01:45:20,910 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-10-11 01:45:20,910 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[0]]]]] [2024-10-11 01:45:20,910 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~1!offset [2024-10-11 01:45:20,910 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-10-11 01:45:20,910 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-10-11 01:45:20,911 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-10-11 01:45:20,911 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head!base,]]] [2024-10-11 01:45:20,911 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-10-11 01:45:20,911 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-10-11 01:45:20,911 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-10-11 01:45:20,911 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-10-11 01:45:20,911 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-10-11 01:45:20,912 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-10-11 01:45:20,912 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-10-11 01:45:20,912 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]],[IntegerLiteral[0]]]]] [2024-10-11 01:45:20,912 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~1!base [2024-10-11 01:45:20,912 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2024-10-11 01:45:20,912 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!base [2024-10-11 01:45:20,912 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-10-11 01:45:20,912 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-10-11 01:45:20,912 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] [2024-10-11 01:45:20,912 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~1!offset [2024-10-11 01:45:20,913 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-10-11 01:45:20,913 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-10-11 01:45:20,913 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]],[IntegerLiteral[0]]]]] [2024-10-11 01:45:20,913 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-10-11 01:45:20,913 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-10-11 01:45:20,913 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[0]]]]] [2024-10-11 01:45:20,913 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!offset [2024-10-11 01:45:20,913 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-11 01:45:20,913 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-11 01:45:20,913 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-10-11 01:45:20,914 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-10-11 01:45:20,914 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-10-11 01:45:20,914 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[0]]]]] [2024-10-11 01:45:20,914 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-10-11 01:45:20,914 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-10-11 01:45:20,914 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-10-11 01:45:20,914 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-10-11 01:45:20,914 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-10-11 01:45:20,914 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2024-10-11 01:45:20,914 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!base [2024-10-11 01:45:20,915 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-10-11 01:45:20,915 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-10-11 01:45:20,915 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-10-11 01:45:20,915 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-10-11 01:45:20,915 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] [2024-10-11 01:45:20,915 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-10-11 01:45:20,915 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-10-11 01:45:20,915 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head!base,]]] [2024-10-11 01:45:20,915 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~1!offset [2024-10-11 01:45:20,915 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!offset [2024-10-11 01:45:20,915 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~1!base [2024-10-11 01:45:20,915 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-11 01:45:20,915 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-11 01:45:20,915 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]] [2024-10-11 01:45:20,916 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-10-11 01:45:20,916 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-11 01:45:20,916 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-11 01:45:20,916 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-10-11 01:45:20,916 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-10-11 01:45:20,916 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-10-11 01:45:20,916 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] [2024-10-11 01:45:20,918 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-10-11 01:45:20,921 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-10-11 01:45:20,921 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-10-11 01:45:20,921 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-10-11 01:45:20,921 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-10-11 01:45:20,921 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!offset [2024-10-11 01:45:20,921 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-10-11 01:45:20,921 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-10-11 01:45:20,922 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-10-11 01:45:20,922 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-10-11 01:45:20,922 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-10-11 01:45:20,922 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~last~0!base,]]] [2024-10-11 01:45:20,922 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-10-11 01:45:20,922 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-10-11 01:45:20,922 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-10-11 01:45:20,922 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~last~0!base,]]] [2024-10-11 01:45:20,922 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-10-11 01:45:20,923 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-10-11 01:45:20,923 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-10-11 01:45:20,923 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-10-11 01:45:20,923 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-10-11 01:45:20,923 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!offset [2024-10-11 01:45:20,923 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-10-11 01:45:20,923 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-10-11 01:45:20,923 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-10-11 01:45:20,923 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-10-11 01:45:20,923 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-10-11 01:45:20,923 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-10-11 01:45:20,923 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-10-11 01:45:20,923 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-10-11 01:45:20,931 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-10-11 01:45:20,931 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-10-11 01:45:20,931 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-10-11 01:45:20,932 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-10-11 01:45:20,932 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-10-11 01:45:20,932 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] [2024-10-11 01:45:20,932 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-10-11 01:45:20,933 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-10-11 01:45:20,933 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[0]]]]] [2024-10-11 01:45:20,933 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-11 01:45:20,933 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-11 01:45:20,933 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-10-11 01:45:20,933 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-10-11 01:45:20,933 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-10-11 01:45:20,933 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[0]]]]] [2024-10-11 01:45:20,933 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-10-11 01:45:20,933 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-10-11 01:45:20,933 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-10-11 01:45:20,934 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-10-11 01:45:20,934 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-10-11 01:45:20,934 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-10-11 01:45:20,934 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] [2024-10-11 01:45:20,934 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-10-11 01:45:20,934 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-11 01:45:20,934 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-11 01:45:20,934 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-10-11 01:45:20,934 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-10-11 01:45:20,934 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-10-11 01:45:20,934 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] [2024-10-11 01:45:20,935 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-10-11 01:45:20,935 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-10-11 01:45:20,935 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-10-11 01:45:20,935 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-11 01:45:20,935 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-11 01:45:20,935 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-10-11 01:45:20,936 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-10-11 01:45:20,936 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2024-10-11 01:45:20,936 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!base [2024-10-11 01:45:20,936 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-10-11 01:45:20,936 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-10-11 01:45:20,936 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-10-11 01:45:20,936 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-10-11 01:45:20,936 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-10-11 01:45:20,937 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-11 01:45:20,937 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-11 01:45:20,937 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-10-11 01:45:20,937 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!offset [2024-10-11 01:45:20,937 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-10-11 01:45:20,937 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-10-11 01:45:20,937 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-10-11 01:45:20,937 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-10-11 01:45:20,937 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2024-10-11 01:45:20,937 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-10-11 01:45:20,937 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-10-11 01:45:20,938 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-10-11 01:45:20,938 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]],[IntegerLiteral[0]]]]] [2024-10-11 01:45:20,938 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~1!base [2024-10-11 01:45:20,938 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2024-10-11 01:45:20,938 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!base [2024-10-11 01:45:20,938 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~1!offset [2024-10-11 01:45:20,938 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-10-11 01:45:20,938 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-10-11 01:45:20,938 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]],[IntegerLiteral[0]]]]] [2024-10-11 01:45:20,938 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!offset [2024-10-11 01:45:20,939 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~snd_to_last~0!base [2024-10-11 01:45:20,939 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-10-11 01:45:20,939 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-10-11 01:45:20,939 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]] [2024-10-11 01:45:20,939 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-10-11 01:45:20,939 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-10-11 01:45:20,939 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-10-11 01:45:20,939 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head!base,]]] [2024-10-11 01:45:20,939 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~snd_to_last~0!offset [2024-10-11 01:45:20,941 WARN L155 FloydHoareUtils]: Requires clause for node_create contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= |old(#memory_$Pointer$#2.base)| |#memory_$Pointer$#2.base|) (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_$Pointer$#2.offset| |old(#memory_$Pointer$#2.offset)|) (= |old(#valid)| |#valid|)) Eliminated clause: true [2024-10-11 01:45:20,943 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-10-11 01:45:20,944 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-10-11 01:45:20,944 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-10-11 01:45:20,944 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#valid,GLOBAL]] [2024-10-11 01:45:20,944 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-10-11 01:45:20,944 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-10-11 01:45:20,944 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[#res!base,]]] [2024-10-11 01:45:20,944 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!base [2024-10-11 01:45:20,944 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-10-11 01:45:20,944 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-10-11 01:45:20,944 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[#res!base,]]] [2024-10-11 01:45:20,945 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!offset [2024-10-11 01:45:20,945 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-10-11 01:45:20,945 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-10-11 01:45:20,945 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-10-11 01:45:20,945 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-10-11 01:45:20,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:45:20 BoogieIcfgContainer [2024-10-11 01:45:20,945 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 01:45:20,946 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 01:45:20,946 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 01:45:20,946 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 01:45:20,946 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:43:58" (3/4) ... [2024-10-11 01:45:20,952 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 01:45:20,955 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2024-10-11 01:45:20,962 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-11 01:45:20,962 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-11 01:45:20,962 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 01:45:20,966 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 01:45:21,058 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 01:45:21,060 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 01:45:21,060 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 01:45:21,061 INFO L158 Benchmark]: Toolchain (without parser) took 84001.40ms. Allocated memory was 130.0MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 60.3MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 641.4MB. Max. memory is 16.1GB. [2024-10-11 01:45:21,062 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 130.0MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 01:45:21,062 INFO L158 Benchmark]: CACSL2BoogieTranslator took 455.30ms. Allocated memory was 130.0MB in the beginning and 190.8MB in the end (delta: 60.8MB). Free memory was 60.1MB in the beginning and 147.8MB in the end (delta: -87.7MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2024-10-11 01:45:21,062 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.88ms. Allocated memory is still 190.8MB. Free memory was 147.8MB in the beginning and 145.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 01:45:21,063 INFO L158 Benchmark]: Boogie Preprocessor took 53.99ms. Allocated memory is still 190.8MB. Free memory was 145.7MB in the beginning and 142.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 01:45:21,063 INFO L158 Benchmark]: RCFGBuilder took 416.44ms. Allocated memory is still 190.8MB. Free memory was 142.6MB in the beginning and 123.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 01:45:21,063 INFO L158 Benchmark]: TraceAbstraction took 82911.36ms. Allocated memory was 190.8MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 123.7MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 638.3MB. Max. memory is 16.1GB. [2024-10-11 01:45:21,064 INFO L158 Benchmark]: Witness Printer took 114.32ms. Allocated memory is still 2.3GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 01:45:21,065 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 130.0MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 455.30ms. Allocated memory was 130.0MB in the beginning and 190.8MB in the end (delta: 60.8MB). Free memory was 60.1MB in the beginning and 147.8MB in the end (delta: -87.7MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.88ms. Allocated memory is still 190.8MB. Free memory was 147.8MB in the beginning and 145.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.99ms. Allocated memory is still 190.8MB. Free memory was 145.7MB in the beginning and 142.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 416.44ms. Allocated memory is still 190.8MB. Free memory was 142.6MB in the beginning and 123.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 82911.36ms. Allocated memory was 190.8MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 123.7MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 638.3MB. Max. memory is 16.1GB. * Witness Printer took 114.32ms. Allocated memory is still 2.3GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~1!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~1!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~1!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~1!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~1!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~1!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~last~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~last~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~1!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~1!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~snd_to_last~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~snd_to_last~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#valid,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[#res!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[#res!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 624]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 82.3s, OverallIterations: 12, TraceHistogramMax: 6, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 265 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 260 mSDsluCounter, 1399 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1198 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2468 IncrementalHoareTripleChecker+Invalid, 2492 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 201 mSDtfsCounter, 2468 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 671 GetRequests, 446 SyntacticMatches, 3 SemanticMatches, 222 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1445 ImplicationChecksByTransitivity, 9.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=10, InterpolantAutomatonStates: 122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 52 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 75.3s InterpolantComputationTime, 714 NumberOfCodeBlocks, 711 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 797 ConstructedInterpolants, 11 QuantifiedInterpolants, 8023 SizeOfPredicates, 35 NumberOfNonLiveVariables, 2658 ConjunctsInSsa, 508 ConjunctsInUnsatCore, 23 InterpolantComputations, 6 PerfectInterpolantSequences, 495/580 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 597]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 586]: Loop Invariant Derived loop invariant: ((((2 <= len) && (len <= 1)) && (data == 1)) || (((2 == len) && (len == 2)) && (data == 1))) - InvariantResult [Line: 617]: Loop Invariant Derived loop invariant: ((((2 <= len) && (i == 0)) || ((2 <= len) && (i <= 1))) || (2 <= len)) - InvariantResult [Line: 605]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2024-10-11 01:45:21,288 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-10-11 01:45:21,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE