/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-commit-1.wvr-bad.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 21:13:35,788 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 21:13:35,789 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 21:13:35,810 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 21:13:35,811 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 21:13:35,811 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 21:13:35,812 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 21:13:35,819 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 21:13:35,822 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 21:13:35,826 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 21:13:35,827 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 21:13:35,828 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 21:13:35,828 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 21:13:35,831 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 21:13:35,833 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 21:13:35,834 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 21:13:35,834 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 21:13:35,835 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 21:13:35,837 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 21:13:35,840 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 21:13:35,840 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 21:13:35,843 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 21:13:35,843 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 21:13:35,843 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 21:13:35,845 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 21:13:35,845 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 21:13:35,845 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 21:13:35,846 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 21:13:35,846 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 21:13:35,847 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 21:13:35,847 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 21:13:35,847 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 21:13:35,847 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 21:13:35,853 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 21:13:35,854 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 21:13:35,854 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 21:13:35,854 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 21:13:35,854 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 21:13:35,855 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 21:13:35,855 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 21:13:35,855 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 21:13:35,857 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-27 21:13:35,885 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 21:13:35,885 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 21:13:35,886 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 21:13:35,886 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 21:13:35,886 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 21:13:35,886 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 21:13:35,886 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 21:13:35,886 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 21:13:35,886 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 21:13:35,886 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 21:13:35,887 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 21:13:35,887 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 21:13:35,887 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 21:13:35,887 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 21:13:35,887 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 21:13:35,887 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 21:13:35,887 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 21:13:35,887 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 21:13:35,887 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 21:13:35,887 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 21:13:35,887 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 21:13:35,887 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 21:13:35,888 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 21:13:35,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 21:13:35,888 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 21:13:35,888 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 21:13:35,888 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 21:13:35,888 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 21:13:35,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 21:13:35,888 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 21:13:35,888 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 21:13:35,888 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-01-27 21:13:36,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 21:13:36,089 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 21:13:36,091 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 21:13:36,092 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 21:13:36,092 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 21:13:36,093 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-commit-1.wvr-bad.c [2023-01-27 21:13:37,145 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 21:13:37,303 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 21:13:37,303 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-commit-1.wvr-bad.c [2023-01-27 21:13:37,310 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29f7ecc41/51e160ff34534a3c8f3f5927dcaa9e5e/FLAG5fc3e0a68 [2023-01-27 21:13:37,323 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29f7ecc41/51e160ff34534a3c8f3f5927dcaa9e5e [2023-01-27 21:13:37,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 21:13:37,326 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 21:13:37,328 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 21:13:37,328 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 21:13:37,330 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 21:13:37,330 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 09:13:37" (1/1) ... [2023-01-27 21:13:37,331 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bef578f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:13:37, skipping insertion in model container [2023-01-27 21:13:37,331 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 09:13:37" (1/1) ... [2023-01-27 21:13:37,336 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 21:13:37,362 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 21:13:37,518 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-commit-1.wvr-bad.c[5161,5174] [2023-01-27 21:13:37,524 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 21:13:37,534 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 21:13:37,566 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-commit-1.wvr-bad.c[5161,5174] [2023-01-27 21:13:37,571 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 21:13:37,580 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 21:13:37,581 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 21:13:37,586 INFO L208 MainTranslator]: Completed translation [2023-01-27 21:13:37,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:13:37 WrapperNode [2023-01-27 21:13:37,586 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 21:13:37,587 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 21:13:37,587 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 21:13:37,587 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 21:13:37,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:13:37" (1/1) ... [2023-01-27 21:13:37,608 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:13:37" (1/1) ... [2023-01-27 21:13:37,633 INFO L138 Inliner]: procedures = 25, calls = 68, calls flagged for inlining = 20, calls inlined = 24, statements flattened = 350 [2023-01-27 21:13:37,633 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 21:13:37,634 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 21:13:37,634 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 21:13:37,634 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 21:13:37,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:13:37" (1/1) ... [2023-01-27 21:13:37,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:13:37" (1/1) ... [2023-01-27 21:13:37,657 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:13:37" (1/1) ... [2023-01-27 21:13:37,657 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:13:37" (1/1) ... [2023-01-27 21:13:37,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:13:37" (1/1) ... [2023-01-27 21:13:37,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:13:37" (1/1) ... [2023-01-27 21:13:37,681 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:13:37" (1/1) ... [2023-01-27 21:13:37,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:13:37" (1/1) ... [2023-01-27 21:13:37,686 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 21:13:37,689 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 21:13:37,689 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 21:13:37,689 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 21:13:37,690 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:13:37" (1/1) ... [2023-01-27 21:13:37,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 21:13:37,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:13:37,746 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-27 21:13:37,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-27 21:13:37,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 21:13:37,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 21:13:37,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 21:13:37,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-27 21:13:37,784 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-27 21:13:37,784 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-27 21:13:37,784 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-27 21:13:37,784 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-27 21:13:37,784 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-01-27 21:13:37,785 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-01-27 21:13:37,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 21:13:37,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 21:13:37,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 21:13:37,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-01-27 21:13:37,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 21:13:37,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 21:13:37,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 21:13:37,786 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 21:13:37,932 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 21:13:37,933 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 21:13:38,290 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 21:13:38,498 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 21:13:38,498 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-01-27 21:13:38,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 09:13:38 BoogieIcfgContainer [2023-01-27 21:13:38,500 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 21:13:38,501 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 21:13:38,502 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 21:13:38,504 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 21:13:38,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 09:13:37" (1/3) ... [2023-01-27 21:13:38,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d0e155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 09:13:38, skipping insertion in model container [2023-01-27 21:13:38,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:13:37" (2/3) ... [2023-01-27 21:13:38,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d0e155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 09:13:38, skipping insertion in model container [2023-01-27 21:13:38,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 09:13:38" (3/3) ... [2023-01-27 21:13:38,508 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-commit-1.wvr-bad.c [2023-01-27 21:13:38,521 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 21:13:38,522 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-27 21:13:38,522 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 21:13:38,607 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-01-27 21:13:38,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 250 places, 267 transitions, 558 flow [2023-01-27 21:13:38,709 INFO L130 PetriNetUnfolder]: 27/264 cut-off events. [2023-01-27 21:13:38,709 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-27 21:13:38,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 264 events. 27/264 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 183 event pairs, 0 based on Foata normal form. 0/236 useless extension candidates. Maximal degree in co-relation 224. Up to 6 conditions per place. [2023-01-27 21:13:38,715 INFO L82 GeneralOperation]: Start removeDead. Operand has 250 places, 267 transitions, 558 flow [2023-01-27 21:13:38,719 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 237 places, 254 transitions, 526 flow [2023-01-27 21:13:38,721 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 21:13:38,727 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 237 places, 254 transitions, 526 flow [2023-01-27 21:13:38,729 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 237 places, 254 transitions, 526 flow [2023-01-27 21:13:38,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 237 places, 254 transitions, 526 flow [2023-01-27 21:13:38,786 INFO L130 PetriNetUnfolder]: 27/254 cut-off events. [2023-01-27 21:13:38,786 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-27 21:13:38,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 254 events. 27/254 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 182 event pairs, 0 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 224. Up to 6 conditions per place. [2023-01-27 21:13:38,791 INFO L119 LiptonReduction]: Number of co-enabled transitions 2700 [2023-01-27 21:13:46,412 INFO L134 LiptonReduction]: Checked pairs total: 2578 [2023-01-27 21:13:46,412 INFO L136 LiptonReduction]: Total number of compositions: 277 [2023-01-27 21:13:46,430 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 21:13:46,439 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@59c98e0c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 21:13:46,439 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-01-27 21:13:46,446 INFO L130 PetriNetUnfolder]: 6/24 cut-off events. [2023-01-27 21:13:46,446 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-27 21:13:46,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:13:46,447 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:13:46,447 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:13:46,450 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:13:46,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1084146320, now seen corresponding path program 1 times [2023-01-27 21:13:46,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:13:46,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050923797] [2023-01-27 21:13:46,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:13:46,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:13:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:13:46,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:13:46,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:13:46,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050923797] [2023-01-27 21:13:46,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050923797] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:13:46,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:13:46,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 21:13:46,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497764083] [2023-01-27 21:13:46,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:13:46,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 21:13:46,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:13:46,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 21:13:46,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 21:13:46,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 544 [2023-01-27 21:13:46,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 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) [2023-01-27 21:13:46,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:13:46,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 544 [2023-01-27 21:13:46,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:13:47,104 INFO L130 PetriNetUnfolder]: 164/251 cut-off events. [2023-01-27 21:13:47,104 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2023-01-27 21:13:47,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 547 conditions, 251 events. 164/251 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 606 event pairs, 37 based on Foata normal form. 1/161 useless extension candidates. Maximal degree in co-relation 376. Up to 167 conditions per place. [2023-01-27 21:13:47,107 INFO L137 encePairwiseOnDemand]: 539/544 looper letters, 36 selfloop transitions, 4 changer transitions 1/41 dead transitions. [2023-01-27 21:13:47,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 41 transitions, 197 flow [2023-01-27 21:13:47,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 21:13:47,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 21:13:47,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 750 transitions. [2023-01-27 21:13:47,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45955882352941174 [2023-01-27 21:13:47,124 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 750 transitions. [2023-01-27 21:13:47,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 750 transitions. [2023-01-27 21:13:47,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:13:47,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 750 transitions. [2023-01-27 21:13:47,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 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) [2023-01-27 21:13:47,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 544.0) internal successors, (2176), 4 states have internal predecessors, (2176), 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) [2023-01-27 21:13:47,149 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 544.0) internal successors, (2176), 4 states have internal predecessors, (2176), 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) [2023-01-27 21:13:47,150 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 68 flow. Second operand 3 states and 750 transitions. [2023-01-27 21:13:47,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 41 transitions, 197 flow [2023-01-27 21:13:47,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 41 transitions, 175 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-01-27 21:13:47,154 INFO L231 Difference]: Finished difference. Result has 26 places, 28 transitions, 82 flow [2023-01-27 21:13:47,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=544, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=26, PETRI_TRANSITIONS=28} [2023-01-27 21:13:47,160 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -3 predicate places. [2023-01-27 21:13:47,161 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 28 transitions, 82 flow [2023-01-27 21:13:47,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 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) [2023-01-27 21:13:47,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:13:47,161 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:13:47,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 21:13:47,162 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:13:47,163 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:13:47,163 INFO L85 PathProgramCache]: Analyzing trace with hash 764426050, now seen corresponding path program 1 times [2023-01-27 21:13:47,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:13:47,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428990928] [2023-01-27 21:13:47,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:13:47,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:13:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:13:47,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:13:47,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:13:47,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428990928] [2023-01-27 21:13:47,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428990928] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:13:47,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:13:47,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 21:13:47,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472855826] [2023-01-27 21:13:47,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:13:47,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 21:13:47,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:13:47,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 21:13:47,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 21:13:47,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 544 [2023-01-27 21:13:47,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 28 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 229.66666666666666) internal successors, (689), 3 states have internal predecessors, (689), 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) [2023-01-27 21:13:47,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:13:47,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 544 [2023-01-27 21:13:47,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:13:47,569 INFO L130 PetriNetUnfolder]: 146/229 cut-off events. [2023-01-27 21:13:47,569 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2023-01-27 21:13:47,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 577 conditions, 229 events. 146/229 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 557 event pairs, 37 based on Foata normal form. 14/240 useless extension candidates. Maximal degree in co-relation 175. Up to 145 conditions per place. [2023-01-27 21:13:47,572 INFO L137 encePairwiseOnDemand]: 540/544 looper letters, 34 selfloop transitions, 3 changer transitions 1/38 dead transitions. [2023-01-27 21:13:47,572 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 38 transitions, 179 flow [2023-01-27 21:13:47,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 21:13:47,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 21:13:47,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 708 transitions. [2023-01-27 21:13:47,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4338235294117647 [2023-01-27 21:13:47,575 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 708 transitions. [2023-01-27 21:13:47,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 708 transitions. [2023-01-27 21:13:47,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:13:47,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 708 transitions. [2023-01-27 21:13:47,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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) [2023-01-27 21:13:47,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 544.0) internal successors, (2176), 4 states have internal predecessors, (2176), 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) [2023-01-27 21:13:47,579 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 544.0) internal successors, (2176), 4 states have internal predecessors, (2176), 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) [2023-01-27 21:13:47,579 INFO L175 Difference]: Start difference. First operand has 26 places, 28 transitions, 82 flow. Second operand 3 states and 708 transitions. [2023-01-27 21:13:47,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 38 transitions, 179 flow [2023-01-27 21:13:47,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 38 transitions, 176 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 21:13:47,582 INFO L231 Difference]: Finished difference. Result has 27 places, 27 transitions, 80 flow [2023-01-27 21:13:47,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=544, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=27, PETRI_TRANSITIONS=27} [2023-01-27 21:13:47,582 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -2 predicate places. [2023-01-27 21:13:47,582 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 27 transitions, 80 flow [2023-01-27 21:13:47,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.66666666666666) internal successors, (689), 3 states have internal predecessors, (689), 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) [2023-01-27 21:13:47,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:13:47,583 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:13:47,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 21:13:47,583 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:13:47,584 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:13:47,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1012909974, now seen corresponding path program 1 times [2023-01-27 21:13:47,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:13:47,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676187460] [2023-01-27 21:13:47,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:13:47,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:13:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:13:47,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:13:47,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:13:47,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676187460] [2023-01-27 21:13:47,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676187460] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:13:47,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:13:47,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 21:13:47,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081409888] [2023-01-27 21:13:47,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:13:47,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 21:13:47,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:13:47,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 21:13:47,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 21:13:47,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 544 [2023-01-27 21:13:47,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 27 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 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) [2023-01-27 21:13:47,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:13:47,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 544 [2023-01-27 21:13:47,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:13:47,913 INFO L130 PetriNetUnfolder]: 263/429 cut-off events. [2023-01-27 21:13:47,913 INFO L131 PetriNetUnfolder]: For 226/226 co-relation queries the response was YES. [2023-01-27 21:13:47,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1050 conditions, 429 events. 263/429 cut-off events. For 226/226 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1282 event pairs, 174 based on Foata normal form. 28/451 useless extension candidates. Maximal degree in co-relation 350. Up to 230 conditions per place. [2023-01-27 21:13:47,914 INFO L137 encePairwiseOnDemand]: 540/544 looper letters, 48 selfloop transitions, 3 changer transitions 0/51 dead transitions. [2023-01-27 21:13:47,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 51 transitions, 246 flow [2023-01-27 21:13:47,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 21:13:47,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 21:13:47,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 841 transitions. [2023-01-27 21:13:47,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3864889705882353 [2023-01-27 21:13:47,916 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 841 transitions. [2023-01-27 21:13:47,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 841 transitions. [2023-01-27 21:13:47,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:13:47,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 841 transitions. [2023-01-27 21:13:47,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 210.25) internal successors, (841), 4 states have internal predecessors, (841), 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) [2023-01-27 21:13:47,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 544.0) internal successors, (2720), 5 states have internal predecessors, (2720), 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) [2023-01-27 21:13:47,921 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 544.0) internal successors, (2720), 5 states have internal predecessors, (2720), 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) [2023-01-27 21:13:47,922 INFO L175 Difference]: Start difference. First operand has 27 places, 27 transitions, 80 flow. Second operand 4 states and 841 transitions. [2023-01-27 21:13:47,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 51 transitions, 246 flow [2023-01-27 21:13:47,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 51 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 21:13:47,924 INFO L231 Difference]: Finished difference. Result has 30 places, 29 transitions, 96 flow [2023-01-27 21:13:47,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=544, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=30, PETRI_TRANSITIONS=29} [2023-01-27 21:13:47,925 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2023-01-27 21:13:47,927 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 29 transitions, 96 flow [2023-01-27 21:13:47,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 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) [2023-01-27 21:13:47,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:13:47,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:13:47,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 21:13:47,928 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:13:47,928 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:13:47,928 INFO L85 PathProgramCache]: Analyzing trace with hash 305019443, now seen corresponding path program 1 times [2023-01-27 21:13:47,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:13:47,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749241661] [2023-01-27 21:13:47,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:13:47,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:13:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:13:48,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:13:48,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:13:48,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749241661] [2023-01-27 21:13:48,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749241661] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:13:48,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:13:48,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 21:13:48,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945387097] [2023-01-27 21:13:48,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:13:48,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 21:13:48,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:13:48,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 21:13:48,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 21:13:48,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 544 [2023-01-27 21:13:48,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 29 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 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) [2023-01-27 21:13:48,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:13:48,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 544 [2023-01-27 21:13:48,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:13:48,188 INFO L130 PetriNetUnfolder]: 261/441 cut-off events. [2023-01-27 21:13:48,188 INFO L131 PetriNetUnfolder]: For 176/176 co-relation queries the response was YES. [2023-01-27 21:13:48,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1073 conditions, 441 events. 261/441 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1364 event pairs, 114 based on Foata normal form. 44/480 useless extension candidates. Maximal degree in co-relation 884. Up to 253 conditions per place. [2023-01-27 21:13:48,189 INFO L137 encePairwiseOnDemand]: 541/544 looper letters, 49 selfloop transitions, 3 changer transitions 1/53 dead transitions. [2023-01-27 21:13:48,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 53 transitions, 272 flow [2023-01-27 21:13:48,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 21:13:48,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 21:13:48,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 959 transitions. [2023-01-27 21:13:48,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4407169117647059 [2023-01-27 21:13:48,194 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 959 transitions. [2023-01-27 21:13:48,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 959 transitions. [2023-01-27 21:13:48,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:13:48,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 959 transitions. [2023-01-27 21:13:48,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 239.75) internal successors, (959), 4 states have internal predecessors, (959), 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) [2023-01-27 21:13:48,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 544.0) internal successors, (2720), 5 states have internal predecessors, (2720), 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) [2023-01-27 21:13:48,200 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 544.0) internal successors, (2720), 5 states have internal predecessors, (2720), 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) [2023-01-27 21:13:48,200 INFO L175 Difference]: Start difference. First operand has 30 places, 29 transitions, 96 flow. Second operand 4 states and 959 transitions. [2023-01-27 21:13:48,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 53 transitions, 272 flow [2023-01-27 21:13:48,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 53 transitions, 262 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-01-27 21:13:48,203 INFO L231 Difference]: Finished difference. Result has 34 places, 29 transitions, 104 flow [2023-01-27 21:13:48,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=544, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=34, PETRI_TRANSITIONS=29} [2023-01-27 21:13:48,205 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 5 predicate places. [2023-01-27 21:13:48,205 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 29 transitions, 104 flow [2023-01-27 21:13:48,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 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) [2023-01-27 21:13:48,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:13:48,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:13:48,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 21:13:48,206 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:13:48,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:13:48,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1752549565, now seen corresponding path program 1 times [2023-01-27 21:13:48,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:13:48,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907199772] [2023-01-27 21:13:48,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:13:48,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:13:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:13:48,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:13:48,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:13:48,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907199772] [2023-01-27 21:13:48,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907199772] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:13:48,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819924695] [2023-01-27 21:13:48,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:13:48,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:13:48,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:13:48,366 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 21:13:48,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-01-27 21:13:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:13:48,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 9 conjunts are in the unsatisfiable core [2023-01-27 21:13:48,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:13:48,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:13:48,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:13:48,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:13:48,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819924695] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:13:48,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:13:48,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2023-01-27 21:13:48,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061730719] [2023-01-27 21:13:48,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:13:48,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 21:13:48,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:13:48,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 21:13:48,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2023-01-27 21:13:48,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 544 [2023-01-27 21:13:48,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 29 transitions, 104 flow. Second operand has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 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) [2023-01-27 21:13:48,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:13:48,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 544 [2023-01-27 21:13:48,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:13:49,066 INFO L130 PetriNetUnfolder]: 270/435 cut-off events. [2023-01-27 21:13:49,066 INFO L131 PetriNetUnfolder]: For 206/206 co-relation queries the response was YES. [2023-01-27 21:13:49,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1129 conditions, 435 events. 270/435 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1355 event pairs, 53 based on Foata normal form. 1/433 useless extension candidates. Maximal degree in co-relation 1108. Up to 281 conditions per place. [2023-01-27 21:13:49,068 INFO L137 encePairwiseOnDemand]: 540/544 looper letters, 42 selfloop transitions, 4 changer transitions 3/49 dead transitions. [2023-01-27 21:13:49,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 49 transitions, 256 flow [2023-01-27 21:13:49,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 21:13:49,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 21:13:49,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 971 transitions. [2023-01-27 21:13:49,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4462316176470588 [2023-01-27 21:13:49,071 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 971 transitions. [2023-01-27 21:13:49,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 971 transitions. [2023-01-27 21:13:49,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:13:49,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 971 transitions. [2023-01-27 21:13:49,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 242.75) internal successors, (971), 4 states have internal predecessors, (971), 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) [2023-01-27 21:13:49,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 544.0) internal successors, (2720), 5 states have internal predecessors, (2720), 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) [2023-01-27 21:13:49,076 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 544.0) internal successors, (2720), 5 states have internal predecessors, (2720), 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) [2023-01-27 21:13:49,076 INFO L175 Difference]: Start difference. First operand has 34 places, 29 transitions, 104 flow. Second operand 4 states and 971 transitions. [2023-01-27 21:13:49,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 49 transitions, 256 flow [2023-01-27 21:13:49,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 49 transitions, 252 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-27 21:13:49,079 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 129 flow [2023-01-27 21:13:49,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=544, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=35, PETRI_TRANSITIONS=31} [2023-01-27 21:13:49,081 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 6 predicate places. [2023-01-27 21:13:49,081 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 129 flow [2023-01-27 21:13:49,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 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) [2023-01-27 21:13:49,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:13:49,082 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:13:49,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-01-27 21:13:49,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:13:49,288 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:13:49,288 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:13:49,288 INFO L85 PathProgramCache]: Analyzing trace with hash 583728145, now seen corresponding path program 2 times [2023-01-27 21:13:49,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:13:49,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976203461] [2023-01-27 21:13:49,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:13:49,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:13:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:13:49,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:13:49,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:13:49,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976203461] [2023-01-27 21:13:49,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976203461] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:13:49,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249245239] [2023-01-27 21:13:49,568 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 21:13:49,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:13:49,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:13:49,569 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 21:13:49,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-01-27 21:13:49,694 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 21:13:49,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:13:49,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 14 conjunts are in the unsatisfiable core [2023-01-27 21:13:49,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:13:49,904 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:13:49,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:13:50,327 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:13:50,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 266 treesize of output 272 [2023-01-27 21:13:50,734 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:13:50,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249245239] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:13:50,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:13:50,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2023-01-27 21:13:50,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878779267] [2023-01-27 21:13:50,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:13:50,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-01-27 21:13:50,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:13:50,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-01-27 21:13:50,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2023-01-27 21:13:50,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 544 [2023-01-27 21:13:50,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 129 flow. Second operand has 13 states, 13 states have (on average 181.46153846153845) internal successors, (2359), 13 states have internal predecessors, (2359), 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) [2023-01-27 21:13:50,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:13:50,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 544 [2023-01-27 21:13:50,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:13:51,030 INFO L130 PetriNetUnfolder]: 437/748 cut-off events. [2023-01-27 21:13:51,030 INFO L131 PetriNetUnfolder]: For 580/580 co-relation queries the response was YES. [2023-01-27 21:13:51,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1943 conditions, 748 events. 437/748 cut-off events. For 580/580 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2956 event pairs, 125 based on Foata normal form. 56/798 useless extension candidates. Maximal degree in co-relation 1921. Up to 196 conditions per place. [2023-01-27 21:13:51,033 INFO L137 encePairwiseOnDemand]: 535/544 looper letters, 66 selfloop transitions, 12 changer transitions 21/99 dead transitions. [2023-01-27 21:13:51,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 99 transitions, 516 flow [2023-01-27 21:13:51,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-27 21:13:51,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-27 21:13:51,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1691 transitions. [2023-01-27 21:13:51,037 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34538398692810457 [2023-01-27 21:13:51,037 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1691 transitions. [2023-01-27 21:13:51,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1691 transitions. [2023-01-27 21:13:51,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:13:51,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1691 transitions. [2023-01-27 21:13:51,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 187.88888888888889) internal successors, (1691), 9 states have internal predecessors, (1691), 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) [2023-01-27 21:13:51,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 544.0) internal successors, (5440), 10 states have internal predecessors, (5440), 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) [2023-01-27 21:13:51,046 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 544.0) internal successors, (5440), 10 states have internal predecessors, (5440), 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) [2023-01-27 21:13:51,046 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 129 flow. Second operand 9 states and 1691 transitions. [2023-01-27 21:13:51,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 99 transitions, 516 flow [2023-01-27 21:13:51,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 99 transitions, 502 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-01-27 21:13:51,049 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 196 flow [2023-01-27 21:13:51,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=544, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=196, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2023-01-27 21:13:51,050 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 15 predicate places. [2023-01-27 21:13:51,050 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 196 flow [2023-01-27 21:13:51,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 181.46153846153845) internal successors, (2359), 13 states have internal predecessors, (2359), 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) [2023-01-27 21:13:51,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:13:51,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:13:51,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-01-27 21:13:51,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-01-27 21:13:51,256 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:13:51,256 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:13:51,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1837674817, now seen corresponding path program 1 times [2023-01-27 21:13:51,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:13:51,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062902168] [2023-01-27 21:13:51,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:13:51,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:13:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:13:52,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:13:52,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:13:52,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062902168] [2023-01-27 21:13:52,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062902168] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:13:52,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77573856] [2023-01-27 21:13:52,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:13:52,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:13:52,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:13:52,034 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 21:13:52,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-01-27 21:13:52,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:13:52,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 23 conjunts are in the unsatisfiable core [2023-01-27 21:13:52,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:13:52,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:13:52,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:13:53,441 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:13:53,442 INFO L350 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 5 new quantified variables, introduced 10 case distinctions, treesize of input 354 treesize of output 458 [2023-01-27 21:13:58,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:13:58,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77573856] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:13:58,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:13:58,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2023-01-27 21:13:58,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143061306] [2023-01-27 21:13:58,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:13:58,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-01-27 21:13:58,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:13:58,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-01-27 21:13:58,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2023-01-27 21:13:58,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 544 [2023-01-27 21:13:58,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 196 flow. Second operand has 17 states, 17 states have (on average 158.47058823529412) internal successors, (2694), 17 states have internal predecessors, (2694), 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) [2023-01-27 21:13:58,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:13:58,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 544 [2023-01-27 21:13:58,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:13:58,985 INFO L130 PetriNetUnfolder]: 980/1656 cut-off events. [2023-01-27 21:13:58,985 INFO L131 PetriNetUnfolder]: For 2039/2039 co-relation queries the response was YES. [2023-01-27 21:13:58,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4768 conditions, 1656 events. 980/1656 cut-off events. For 2039/2039 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8028 event pairs, 222 based on Foata normal form. 6/1660 useless extension candidates. Maximal degree in co-relation 2917. Up to 479 conditions per place. [2023-01-27 21:13:58,991 INFO L137 encePairwiseOnDemand]: 537/544 looper letters, 76 selfloop transitions, 28 changer transitions 29/133 dead transitions. [2023-01-27 21:13:58,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 133 transitions, 829 flow [2023-01-27 21:13:58,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-27 21:13:58,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-27 21:13:58,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1978 transitions. [2023-01-27 21:13:58,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30300245098039214 [2023-01-27 21:13:58,996 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1978 transitions. [2023-01-27 21:13:58,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1978 transitions. [2023-01-27 21:13:58,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:13:58,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1978 transitions. [2023-01-27 21:13:58,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 164.83333333333334) internal successors, (1978), 12 states have internal predecessors, (1978), 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) [2023-01-27 21:13:59,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 544.0) internal successors, (7072), 13 states have internal predecessors, (7072), 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) [2023-01-27 21:13:59,006 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 544.0) internal successors, (7072), 13 states have internal predecessors, (7072), 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) [2023-01-27 21:13:59,006 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 196 flow. Second operand 12 states and 1978 transitions. [2023-01-27 21:13:59,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 133 transitions, 829 flow [2023-01-27 21:13:59,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 133 transitions, 817 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-27 21:13:59,010 INFO L231 Difference]: Finished difference. Result has 56 places, 58 transitions, 454 flow [2023-01-27 21:13:59,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=544, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=454, PETRI_PLACES=56, PETRI_TRANSITIONS=58} [2023-01-27 21:13:59,011 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 27 predicate places. [2023-01-27 21:13:59,011 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 58 transitions, 454 flow [2023-01-27 21:13:59,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 158.47058823529412) internal successors, (2694), 17 states have internal predecessors, (2694), 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) [2023-01-27 21:13:59,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:13:59,012 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:13:59,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-01-27 21:13:59,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:13:59,217 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:13:59,218 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:13:59,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1641038422, now seen corresponding path program 1 times [2023-01-27 21:13:59,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:13:59,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315271374] [2023-01-27 21:13:59,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:13:59,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:13:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:13:59,463 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:13:59,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:13:59,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315271374] [2023-01-27 21:13:59,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315271374] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:13:59,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143837892] [2023-01-27 21:13:59,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:13:59,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:13:59,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:13:59,465 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 21:13:59,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-01-27 21:13:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:13:59,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-27 21:13:59,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:13:59,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 21:13:59,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:14:00,517 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:14:00,518 INFO L350 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 505 treesize of output 536 [2023-01-27 21:14:01,219 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 21:14:01,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143837892] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:14:01,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:14:01,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2023-01-27 21:14:01,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589533089] [2023-01-27 21:14:01,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:14:01,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-01-27 21:14:01,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:14:01,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-01-27 21:14:01,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-01-27 21:14:01,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 544 [2023-01-27 21:14:01,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 58 transitions, 454 flow. Second operand has 11 states, 11 states have (on average 198.0) internal successors, (2178), 11 states have internal predecessors, (2178), 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) [2023-01-27 21:14:01,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:14:01,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 544 [2023-01-27 21:14:01,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:14:01,526 INFO L130 PetriNetUnfolder]: 980/1686 cut-off events. [2023-01-27 21:14:01,527 INFO L131 PetriNetUnfolder]: For 3197/3197 co-relation queries the response was YES. [2023-01-27 21:14:01,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5207 conditions, 1686 events. 980/1686 cut-off events. For 3197/3197 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8328 event pairs, 270 based on Foata normal form. 60/1744 useless extension candidates. Maximal degree in co-relation 4593. Up to 537 conditions per place. [2023-01-27 21:14:01,532 INFO L137 encePairwiseOnDemand]: 540/544 looper letters, 57 selfloop transitions, 14 changer transitions 13/84 dead transitions. [2023-01-27 21:14:01,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 84 transitions, 671 flow [2023-01-27 21:14:01,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 21:14:01,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 21:14:01,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1023 transitions. [2023-01-27 21:14:01,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3761029411764706 [2023-01-27 21:14:01,535 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1023 transitions. [2023-01-27 21:14:01,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1023 transitions. [2023-01-27 21:14:01,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:14:01,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1023 transitions. [2023-01-27 21:14:01,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 204.6) internal successors, (1023), 5 states have internal predecessors, (1023), 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) [2023-01-27 21:14:01,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 544.0) internal successors, (3264), 6 states have internal predecessors, (3264), 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) [2023-01-27 21:14:01,540 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 544.0) internal successors, (3264), 6 states have internal predecessors, (3264), 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) [2023-01-27 21:14:01,540 INFO L175 Difference]: Start difference. First operand has 56 places, 58 transitions, 454 flow. Second operand 5 states and 1023 transitions. [2023-01-27 21:14:01,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 84 transitions, 671 flow [2023-01-27 21:14:01,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 84 transitions, 601 flow, removed 28 selfloop flow, removed 3 redundant places. [2023-01-27 21:14:01,545 INFO L231 Difference]: Finished difference. Result has 58 places, 55 transitions, 385 flow [2023-01-27 21:14:01,545 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=544, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=385, PETRI_PLACES=58, PETRI_TRANSITIONS=55} [2023-01-27 21:14:01,545 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 29 predicate places. [2023-01-27 21:14:01,545 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 55 transitions, 385 flow [2023-01-27 21:14:01,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 198.0) internal successors, (2178), 11 states have internal predecessors, (2178), 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) [2023-01-27 21:14:01,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:14:01,546 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:14:01,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-01-27 21:14:01,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:14:01,751 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:14:01,752 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:14:01,752 INFO L85 PathProgramCache]: Analyzing trace with hash 704380673, now seen corresponding path program 2 times [2023-01-27 21:14:01,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:14:01,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088620604] [2023-01-27 21:14:01,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:14:01,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:14:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:14:02,152 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 21:14:02,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:14:02,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088620604] [2023-01-27 21:14:02,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088620604] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:14:02,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977342641] [2023-01-27 21:14:02,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 21:14:02,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:14:02,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:14:02,170 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 21:14:02,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-01-27 21:14:02,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 21:14:02,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:14:02,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 13 conjunts are in the unsatisfiable core [2023-01-27 21:14:02,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:14:02,464 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 21:14:02,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:14:03,288 INFO L321 Elim1Store]: treesize reduction 38, result has 77.5 percent of original size [2023-01-27 21:14:03,288 INFO L350 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 5 new quantified variables, introduced 10 case distinctions, treesize of input 550 treesize of output 600 [2023-01-27 21:14:04,058 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 21:14:04,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977342641] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:14:04,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:14:04,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2023-01-27 21:14:04,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869366228] [2023-01-27 21:14:04,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:14:04,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-01-27 21:14:04,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:14:04,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-01-27 21:14:04,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2023-01-27 21:14:04,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 544 [2023-01-27 21:14:04,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 55 transitions, 385 flow. Second operand has 14 states, 14 states have (on average 162.85714285714286) internal successors, (2280), 14 states have internal predecessors, (2280), 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) [2023-01-27 21:14:04,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:14:04,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 544 [2023-01-27 21:14:04,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:14:04,964 INFO L130 PetriNetUnfolder]: 1766/3030 cut-off events. [2023-01-27 21:14:04,964 INFO L131 PetriNetUnfolder]: For 5585/5585 co-relation queries the response was YES. [2023-01-27 21:14:04,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9177 conditions, 3030 events. 1766/3030 cut-off events. For 5585/5585 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 16713 event pairs, 384 based on Foata normal form. 72/3100 useless extension candidates. Maximal degree in co-relation 7922. Up to 546 conditions per place. [2023-01-27 21:14:04,977 INFO L137 encePairwiseOnDemand]: 534/544 looper letters, 93 selfloop transitions, 34 changer transitions 64/191 dead transitions. [2023-01-27 21:14:04,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 191 transitions, 1307 flow [2023-01-27 21:14:04,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-27 21:14:04,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-01-27 21:14:04,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3025 transitions. [2023-01-27 21:14:04,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30892565359477125 [2023-01-27 21:14:04,984 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3025 transitions. [2023-01-27 21:14:04,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3025 transitions. [2023-01-27 21:14:04,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:14:04,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3025 transitions. [2023-01-27 21:14:04,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 168.05555555555554) internal successors, (3025), 18 states have internal predecessors, (3025), 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) [2023-01-27 21:14:04,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 544.0) internal successors, (10336), 19 states have internal predecessors, (10336), 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) [2023-01-27 21:14:05,000 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 544.0) internal successors, (10336), 19 states have internal predecessors, (10336), 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) [2023-01-27 21:14:05,000 INFO L175 Difference]: Start difference. First operand has 58 places, 55 transitions, 385 flow. Second operand 18 states and 3025 transitions. [2023-01-27 21:14:05,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 191 transitions, 1307 flow [2023-01-27 21:14:05,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 191 transitions, 1273 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-01-27 21:14:05,012 INFO L231 Difference]: Finished difference. Result has 77 places, 67 transitions, 589 flow [2023-01-27 21:14:05,013 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=544, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=589, PETRI_PLACES=77, PETRI_TRANSITIONS=67} [2023-01-27 21:14:05,013 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 48 predicate places. [2023-01-27 21:14:05,013 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 67 transitions, 589 flow [2023-01-27 21:14:05,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 162.85714285714286) internal successors, (2280), 14 states have internal predecessors, (2280), 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) [2023-01-27 21:14:05,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:14:05,014 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:14:05,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-01-27 21:14:05,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:14:05,221 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:14:05,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:14:05,222 INFO L85 PathProgramCache]: Analyzing trace with hash 712731656, now seen corresponding path program 1 times [2023-01-27 21:14:05,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:14:05,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041906373] [2023-01-27 21:14:05,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:14:05,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:14:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:14:05,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:14:05,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:14:05,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041906373] [2023-01-27 21:14:05,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041906373] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:14:05,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132391113] [2023-01-27 21:14:05,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:14:05,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:14:05,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:14:05,526 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 21:14:05,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-01-27 21:14:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:14:05,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-27 21:14:05,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:14:06,054 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 21:14:06,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:14:07,285 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:14:07,286 INFO L350 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 5 new quantified variables, introduced 10 case distinctions, treesize of input 399 treesize of output 506 [2023-01-27 21:14:08,685 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 21:14:08,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132391113] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:14:08,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:14:08,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 15 [2023-01-27 21:14:08,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417992894] [2023-01-27 21:14:08,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:14:08,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-01-27 21:14:08,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:14:08,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-01-27 21:14:08,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2023-01-27 21:14:08,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 544 [2023-01-27 21:14:08,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 67 transitions, 589 flow. Second operand has 16 states, 16 states have (on average 165.125) internal successors, (2642), 16 states have internal predecessors, (2642), 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) [2023-01-27 21:14:08,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:14:08,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 544 [2023-01-27 21:14:08,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:14:09,394 INFO L130 PetriNetUnfolder]: 1822/3231 cut-off events. [2023-01-27 21:14:09,394 INFO L131 PetriNetUnfolder]: For 8771/8771 co-relation queries the response was YES. [2023-01-27 21:14:09,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9861 conditions, 3231 events. 1822/3231 cut-off events. For 8771/8771 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 19039 event pairs, 414 based on Foata normal form. 196/3427 useless extension candidates. Maximal degree in co-relation 8393. Up to 602 conditions per place. [2023-01-27 21:14:09,409 INFO L137 encePairwiseOnDemand]: 538/544 looper letters, 96 selfloop transitions, 28 changer transitions 48/172 dead transitions. [2023-01-27 21:14:09,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 172 transitions, 1342 flow [2023-01-27 21:14:09,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-01-27 21:14:09,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-01-27 21:14:09,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2230 transitions. [2023-01-27 21:14:09,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3153280542986425 [2023-01-27 21:14:09,414 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2230 transitions. [2023-01-27 21:14:09,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2230 transitions. [2023-01-27 21:14:09,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:14:09,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2230 transitions. [2023-01-27 21:14:09,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 171.53846153846155) internal successors, (2230), 13 states have internal predecessors, (2230), 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) [2023-01-27 21:14:09,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 544.0) internal successors, (7616), 14 states have internal predecessors, (7616), 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) [2023-01-27 21:14:09,425 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 544.0) internal successors, (7616), 14 states have internal predecessors, (7616), 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) [2023-01-27 21:14:09,425 INFO L175 Difference]: Start difference. First operand has 77 places, 67 transitions, 589 flow. Second operand 13 states and 2230 transitions. [2023-01-27 21:14:09,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 172 transitions, 1342 flow [2023-01-27 21:14:09,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 172 transitions, 1220 flow, removed 37 selfloop flow, removed 9 redundant places. [2023-01-27 21:14:09,444 INFO L231 Difference]: Finished difference. Result has 80 places, 62 transitions, 525 flow [2023-01-27 21:14:09,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=544, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=525, PETRI_PLACES=80, PETRI_TRANSITIONS=62} [2023-01-27 21:14:09,445 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 51 predicate places. [2023-01-27 21:14:09,445 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 62 transitions, 525 flow [2023-01-27 21:14:09,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 165.125) internal successors, (2642), 16 states have internal predecessors, (2642), 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) [2023-01-27 21:14:09,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:14:09,446 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:14:09,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-01-27 21:14:09,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:14:09,651 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:14:09,651 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:14:09,651 INFO L85 PathProgramCache]: Analyzing trace with hash 998744017, now seen corresponding path program 1 times [2023-01-27 21:14:09,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:14:09,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022599071] [2023-01-27 21:14:09,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:14:09,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:14:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:14:11,585 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:14:11,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:14:11,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022599071] [2023-01-27 21:14:11,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022599071] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:14:11,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711914184] [2023-01-27 21:14:11,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:14:11,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:14:11,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:14:11,586 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 21:14:11,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-01-27 21:14:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:14:11,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 20 conjunts are in the unsatisfiable core [2023-01-27 21:14:11,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:14:11,980 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 21:14:11,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:14:13,768 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:14:13,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 410 treesize of output 581 [2023-01-27 21:14:16,736 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-27 21:14:16,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711914184] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:14:16,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:14:16,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 17 [2023-01-27 21:14:16,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395464651] [2023-01-27 21:14:16,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:14:16,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-01-27 21:14:16,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:14:16,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-01-27 21:14:16,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2023-01-27 21:14:16,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 544 [2023-01-27 21:14:16,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 62 transitions, 525 flow. Second operand has 19 states, 19 states have (on average 151.89473684210526) internal successors, (2886), 19 states have internal predecessors, (2886), 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) [2023-01-27 21:14:16,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:14:16,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 544 [2023-01-27 21:14:16,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:14:18,438 INFO L130 PetriNetUnfolder]: 1834/3147 cut-off events. [2023-01-27 21:14:18,438 INFO L131 PetriNetUnfolder]: For 6399/6399 co-relation queries the response was YES. [2023-01-27 21:14:18,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9956 conditions, 3147 events. 1834/3147 cut-off events. For 6399/6399 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 17578 event pairs, 293 based on Foata normal form. 9/3156 useless extension candidates. Maximal degree in co-relation 8225. Up to 847 conditions per place. [2023-01-27 21:14:18,454 INFO L137 encePairwiseOnDemand]: 534/544 looper letters, 75 selfloop transitions, 51 changer transitions 43/169 dead transitions. [2023-01-27 21:14:18,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 169 transitions, 1303 flow [2023-01-27 21:14:18,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-27 21:14:18,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-01-27 21:14:18,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2657 transitions. [2023-01-27 21:14:18,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2873053633217993 [2023-01-27 21:14:18,460 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2657 transitions. [2023-01-27 21:14:18,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2657 transitions. [2023-01-27 21:14:18,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:14:18,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2657 transitions. [2023-01-27 21:14:18,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 156.2941176470588) internal successors, (2657), 17 states have internal predecessors, (2657), 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) [2023-01-27 21:14:18,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 544.0) internal successors, (9792), 18 states have internal predecessors, (9792), 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) [2023-01-27 21:14:18,472 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 544.0) internal successors, (9792), 18 states have internal predecessors, (9792), 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) [2023-01-27 21:14:18,472 INFO L175 Difference]: Start difference. First operand has 80 places, 62 transitions, 525 flow. Second operand 17 states and 2657 transitions. [2023-01-27 21:14:18,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 169 transitions, 1303 flow [2023-01-27 21:14:18,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 169 transitions, 1247 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-01-27 21:14:18,483 INFO L231 Difference]: Finished difference. Result has 93 places, 81 transitions, 850 flow [2023-01-27 21:14:18,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=544, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=850, PETRI_PLACES=93, PETRI_TRANSITIONS=81} [2023-01-27 21:14:18,484 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 64 predicate places. [2023-01-27 21:14:18,484 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 81 transitions, 850 flow [2023-01-27 21:14:18,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 151.89473684210526) internal successors, (2886), 19 states have internal predecessors, (2886), 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) [2023-01-27 21:14:18,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:14:18,485 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:14:18,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-01-27 21:14:18,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:14:18,690 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:14:18,690 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:14:18,690 INFO L85 PathProgramCache]: Analyzing trace with hash -230445003, now seen corresponding path program 1 times [2023-01-27 21:14:18,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:14:18,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913177069] [2023-01-27 21:14:18,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:14:18,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:14:18,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:14:19,859 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:14:19,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:14:19,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913177069] [2023-01-27 21:14:19,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913177069] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:14:19,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880711804] [2023-01-27 21:14:19,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:14:19,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:14:19,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:14:19,885 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 21:14:19,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-01-27 21:14:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:14:20,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 35 conjunts are in the unsatisfiable core [2023-01-27 21:14:20,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:14:20,126 INFO L350 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 15 treesize of output 11 [2023-01-27 21:14:20,164 INFO L350 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 6 treesize of output 5 [2023-01-27 21:14:20,203 INFO L350 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 6 treesize of output 5 [2023-01-27 21:14:20,241 INFO L350 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 6 treesize of output 5 [2023-01-27 21:14:20,706 INFO L321 Elim1Store]: treesize reduction 45, result has 53.6 percent of original size [2023-01-27 21:14:20,707 INFO L350 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 125 treesize of output 104 [2023-01-27 21:14:20,735 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 21:14:20,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:15:01,870 WARN L222 SmtUtils]: Spent 35.96s on a formula simplification. DAG size of input: 119 DAG size of output: 94 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:15:03,857 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:15:03,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 51 [2023-01-27 21:15:03,872 INFO L321 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2023-01-27 21:15:03,873 INFO L350 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 6774 treesize of output 6246 [2023-01-27 21:15:04,057 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:15:04,058 INFO L350 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 1550 treesize of output 1463 [2023-01-27 21:15:04,083 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:15:04,083 INFO L350 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 1446 treesize of output 1255 [2023-01-27 21:15:04,108 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:15:04,109 INFO L350 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 1238 treesize of output 839 [2023-01-27 21:15:04,963 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:15:04,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 50 [2023-01-27 21:15:04,971 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-01-27 21:15:04,971 INFO L350 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 398 treesize of output 369 [2023-01-27 21:15:04,985 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-01-27 21:15:04,986 INFO L350 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 178 treesize of output 130 [2023-01-27 21:15:04,991 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 21:15:04,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2023-01-27 21:15:05,001 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-01-27 21:15:05,001 INFO L350 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 70 treesize of output 46 [2023-01-27 21:15:05,064 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:15:05,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 50 [2023-01-27 21:15:05,074 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-01-27 21:15:05,075 INFO L350 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 806 treesize of output 745 [2023-01-27 21:15:05,091 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 21:15:05,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 59 [2023-01-27 21:15:05,099 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 21:15:05,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2023-01-27 21:15:05,129 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-01-27 21:15:05,130 INFO L350 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 90 treesize of output 42 [2023-01-27 21:15:05,161 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:15:05,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 89 [2023-01-27 21:15:05,195 INFO L321 Elim1Store]: treesize reduction 14, result has 72.0 percent of original size [2023-01-27 21:15:05,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3372 treesize of output 3143 [2023-01-27 21:15:05,234 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 21:15:05,245 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:15:05,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 3108 treesize of output 2941 [2023-01-27 21:15:05,286 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 21:15:05,297 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:15:05,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 2908 treesize of output 2141 [2023-01-27 21:15:05,340 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 21:15:05,352 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:15:05,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 2108 treesize of output 1741 [2023-01-27 21:15:09,940 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:15:09,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 51 [2023-01-27 21:15:09,957 INFO L321 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2023-01-27 21:15:09,957 INFO L350 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 6774 treesize of output 6246 [2023-01-27 21:15:10,132 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:15:10,132 INFO L350 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 1550 treesize of output 1359 [2023-01-27 21:15:10,157 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:15:10,158 INFO L350 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 1342 treesize of output 1255 [2023-01-27 21:15:10,184 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:15:10,184 INFO L350 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 1238 treesize of output 839 [2023-01-27 21:15:11,150 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 21:15:11,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880711804] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:15:11,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:15:11,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 28 [2023-01-27 21:15:11,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817493807] [2023-01-27 21:15:11,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:15:11,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-01-27 21:15:11,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:15:11,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-01-27 21:15:11,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=712, Unknown=11, NotChecked=0, Total=870 [2023-01-27 21:15:11,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 544 [2023-01-27 21:15:11,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 81 transitions, 850 flow. Second operand has 30 states, 30 states have (on average 132.5) internal successors, (3975), 30 states have internal predecessors, (3975), 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) [2023-01-27 21:15:11,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:15:11,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 544 [2023-01-27 21:15:11,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:15:14,461 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse17 (= c_~node_state~0 1)) (.cse38 (select |c_#memory_int| c_~manager~0.base)) (.cse35 (select |c_#memory_int| c_~node~0.base)) (.cse37 (+ (* c_~node_front~0 4) c_~node~0.offset)) (.cse5 (= c_~node_state~0 0))) (let ((.cse9 (not .cse5)) (.cse10 (< c_~node_front~0 0)) (.cse11 (<= c_~node_size~0 c_~node_front~0)) (.cse32 (= c_~update~0 (select .cse35 .cse37))) (.cse12 (<= c_~node_back~0 c_~node_front~0)) (.cse39 (not (= (select .cse38 (+ c_~manager~0.offset (* c_~manager_back~0 4))) c_~ok~0))) (.cse40 (<= c_~manager_size~0 c_~manager_back~0)) (.cse41 (not (= (mod c_~safe~0 256) 0))) (.cse16 (not .cse17))) (let ((.cse23 (<= (+ c_~node_back~0 1) c_~node_front~0)) (.cse4 (+ (* c_~node_back~0 4) c_~node~0.offset)) (.cse20 (= c_~manager_state~0 1)) (.cse31 (or .cse39 (< c_~manager_back~0 0) .cse40 .cse41 .cse16)) (.cse27 (or .cse9 .cse10 .cse11 .cse32 .cse12)) (.cse33 (or .cse17 .cse41 .cse5)) (.cse30 (= 2 c_~manager_state~0)) (.cse21 (= c_~manager_state~0 0))) (let ((.cse7 (not .cse21)) (.cse24 (<= c_~manager_back~0 c_~manager_front~0)) (.cse26 (and (or .cse17 .cse5) (or .cse39 .cse40 .cse16))) (.cse25 (select .cse38 (+ (* 4 c_~manager_front~0) c_~manager~0.offset))) (.cse28 (< c_~manager_front~0 0)) (.cse29 (<= c_~manager_size~0 c_~manager_front~0)) (.cse19 (not .cse30)) (.cse1 (and .cse31 .cse27 .cse33)) (.cse0 (= 3 c_~manager_state~0)) (.cse22 (and (or .cse10 .cse11 .cse12) .cse5)) (.cse6 (< c_~node_back~0 0)) (.cse34 (not .cse20)) (.cse8 (<= c_~node_size~0 c_~node_back~0)) (.cse2 (or .cse10 .cse23 (forall ((v_ArrVal_533 (Array Int Int))) (let ((.cse36 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_533) c_~node~0.base))) (= (select .cse36 .cse4) (select .cse36 .cse37))))))) (and (or (not (= (select (select |c_#memory_int| c_~client~0.base) (+ (* c_~client_back~0 4) c_~client~0.offset)) c_~ok~0)) (< c_~client_back~0 0) (not .cse0) .cse1 (<= c_~client_size~0 c_~client_back~0)) (or (and .cse2 (or (forall ((~manager~0.base Int) (v_~manager_front~0_120 Int) (v_ArrVal_533 (Array Int Int)) (~manager~0.offset Int)) (or (< v_~manager_front~0_120 1) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_533))) (= (select (select .cse3 c_~node~0.base) .cse4) (select (select .cse3 ~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_120 4))))))) .cse5)) .cse6 .cse7 .cse8) (or (and (or .cse9 .cse10 .cse11 .cse12) (or (forall ((~manager~0.base Int) (v_~client_back~0_115 Int) (~manager_back~0 Int) (~client~0.base Int) (~client~0.offset Int) (v_~manager_front~0_120 Int) (v_ArrVal_533 (Array Int Int)) (~manager~0.offset Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_533))) (let ((.cse13 (select .cse15 ~manager~0.base)) (.cse14 (select (select .cse15 ~client~0.base) (+ (* v_~client_back~0_115 4) ~client~0.offset)))) (or (< v_~manager_front~0_120 1) (<= (+ ~manager_back~0 1) v_~manager_front~0_120) (not (= (select .cse13 (+ ~manager~0.offset (* ~manager_back~0 4))) .cse14)) (< v_~client_back~0_115 0) (= (select .cse13 (+ ~manager~0.offset (- 4) (* v_~manager_front~0_120 4))) .cse14))))) .cse16) (or .cse17 (forall ((v_~client_back~0_115 Int) (~manager~0.base Int) (~client~0.base Int) (~client~0.offset Int) (v_~manager_front~0_120 Int) (v_ArrVal_533 (Array Int Int)) (~manager~0.offset Int)) (or (< v_~manager_front~0_120 1) (< v_~client_back~0_115 0) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_533))) (= (select (select .cse18 ~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_120 4))) (select (select .cse18 ~client~0.base) (+ (* v_~client_back~0_115 4) ~client~0.offset)))))) .cse5)) .cse19) (or (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (and (or .cse20 .cse21 .cse22) (or .cse6 (and (or .cse10 .cse23 (= c_~node_front~0 c_~node_back~0)) .cse5) .cse8))) (or .cse24 (and (or (= c_~update~0 .cse25) .cse26) .cse27) .cse7 .cse28 .cse29) (or .cse20 .cse21) .cse5 (or .cse20 .cse21 (and (or .cse24 (and .cse27 (or .cse26 (= c_~ok~0 .cse25))) .cse28 .cse29 .cse19) (or .cse1 .cse30 .cse0))) (or (and .cse31 (or .cse9 .cse10 .cse23 .cse32) .cse33) .cse6 .cse34 (not (= (select .cse35 .cse4) c_~update~0)) .cse8) (or .cse20 .cse21 .cse22 .cse30) (or .cse6 .cse34 .cse8 (and .cse2 .cse5))))))) is different from false [2023-01-27 21:15:16,767 INFO L130 PetriNetUnfolder]: 5377/9164 cut-off events. [2023-01-27 21:15:16,768 INFO L131 PetriNetUnfolder]: For 26237/26237 co-relation queries the response was YES. [2023-01-27 21:15:16,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30632 conditions, 9164 events. 5377/9164 cut-off events. For 26237/26237 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 62785 event pairs, 821 based on Foata normal form. 15/9179 useless extension candidates. Maximal degree in co-relation 23973. Up to 2269 conditions per place. [2023-01-27 21:15:16,812 INFO L137 encePairwiseOnDemand]: 527/544 looper letters, 186 selfloop transitions, 135 changer transitions 113/434 dead transitions. [2023-01-27 21:15:16,813 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 434 transitions, 3725 flow [2023-01-27 21:15:16,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-01-27 21:15:16,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2023-01-27 21:15:16,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 5661 transitions. [2023-01-27 21:15:16,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2538109756097561 [2023-01-27 21:15:16,823 INFO L72 ComplementDD]: Start complementDD. Operand 41 states and 5661 transitions. [2023-01-27 21:15:16,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 5661 transitions. [2023-01-27 21:15:16,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:15:16,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 41 states and 5661 transitions. [2023-01-27 21:15:16,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 42 states, 41 states have (on average 138.0731707317073) internal successors, (5661), 41 states have internal predecessors, (5661), 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) [2023-01-27 21:15:16,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 42 states, 42 states have (on average 544.0) internal successors, (22848), 42 states have internal predecessors, (22848), 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) [2023-01-27 21:15:16,845 INFO L81 ComplementDD]: Finished complementDD. Result has 42 states, 42 states have (on average 544.0) internal successors, (22848), 42 states have internal predecessors, (22848), 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) [2023-01-27 21:15:16,845 INFO L175 Difference]: Start difference. First operand has 93 places, 81 transitions, 850 flow. Second operand 41 states and 5661 transitions. [2023-01-27 21:15:16,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 434 transitions, 3725 flow [2023-01-27 21:15:16,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 434 transitions, 3469 flow, removed 113 selfloop flow, removed 4 redundant places. [2023-01-27 21:15:16,910 INFO L231 Difference]: Finished difference. Result has 141 places, 190 transitions, 2429 flow [2023-01-27 21:15:16,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=544, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=2429, PETRI_PLACES=141, PETRI_TRANSITIONS=190} [2023-01-27 21:15:16,910 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 112 predicate places. [2023-01-27 21:15:16,911 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 190 transitions, 2429 flow [2023-01-27 21:15:16,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 132.5) internal successors, (3975), 30 states have internal predecessors, (3975), 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) [2023-01-27 21:15:16,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:15:16,911 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:15:16,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-01-27 21:15:17,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-01-27 21:15:17,116 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:15:17,117 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:15:17,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1736138213, now seen corresponding path program 2 times [2023-01-27 21:15:17,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:15:17,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962756184] [2023-01-27 21:15:17,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:15:17,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:15:17,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:15:17,783 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:15:17,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:15:17,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962756184] [2023-01-27 21:15:17,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962756184] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:15:17,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937439553] [2023-01-27 21:15:17,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 21:15:17,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:15:17,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:15:17,785 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 21:15:17,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-01-27 21:15:17,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 21:15:17,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:15:17,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 16 conjunts are in the unsatisfiable core [2023-01-27 21:15:17,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:15:18,488 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 21:15:18,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:15:26,655 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:15:26,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 603 treesize of output 1120 [2023-01-27 21:15:49,294 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 21:15:49,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937439553] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:15:49,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:15:49,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2023-01-27 21:15:49,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682723053] [2023-01-27 21:15:49,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:15:49,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-01-27 21:15:49,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:15:49,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-01-27 21:15:49,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2023-01-27 21:15:49,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 544 [2023-01-27 21:15:49,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 190 transitions, 2429 flow. Second operand has 24 states, 24 states have (on average 151.66666666666666) internal successors, (3640), 24 states have internal predecessors, (3640), 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) [2023-01-27 21:15:49,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:15:49,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 544 [2023-01-27 21:15:49,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:15:58,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:16:16,046 WARN L222 SmtUtils]: Spent 16.72s on a formula simplification. DAG size of input: 113 DAG size of output: 110 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:16:18,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:16:20,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:16:21,300 INFO L130 PetriNetUnfolder]: 4817/8405 cut-off events. [2023-01-27 21:16:21,300 INFO L131 PetriNetUnfolder]: For 35092/35092 co-relation queries the response was YES. [2023-01-27 21:16:21,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35089 conditions, 8405 events. 4817/8405 cut-off events. For 35092/35092 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 58027 event pairs, 794 based on Foata normal form. 160/8565 useless extension candidates. Maximal degree in co-relation 34476. Up to 4938 conditions per place. [2023-01-27 21:16:21,350 INFO L137 encePairwiseOnDemand]: 534/544 looper letters, 215 selfloop transitions, 147 changer transitions 103/465 dead transitions. [2023-01-27 21:16:21,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 465 transitions, 4552 flow [2023-01-27 21:16:21,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-01-27 21:16:21,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-01-27 21:16:21,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 5407 transitions. [2023-01-27 21:16:21,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2923334775086505 [2023-01-27 21:16:21,356 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 5407 transitions. [2023-01-27 21:16:21,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 5407 transitions. [2023-01-27 21:16:21,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:16:21,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 5407 transitions. [2023-01-27 21:16:21,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 159.02941176470588) internal successors, (5407), 34 states have internal predecessors, (5407), 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) [2023-01-27 21:16:21,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 544.0) internal successors, (19040), 35 states have internal predecessors, (19040), 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) [2023-01-27 21:16:21,373 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 544.0) internal successors, (19040), 35 states have internal predecessors, (19040), 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) [2023-01-27 21:16:21,373 INFO L175 Difference]: Start difference. First operand has 141 places, 190 transitions, 2429 flow. Second operand 34 states and 5407 transitions. [2023-01-27 21:16:21,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 465 transitions, 4552 flow [2023-01-27 21:16:21,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 465 transitions, 4192 flow, removed 134 selfloop flow, removed 13 redundant places. [2023-01-27 21:16:21,477 INFO L231 Difference]: Finished difference. Result has 163 places, 192 transitions, 2441 flow [2023-01-27 21:16:21,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=544, PETRI_DIFFERENCE_MINUEND_FLOW=1590, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=2441, PETRI_PLACES=163, PETRI_TRANSITIONS=192} [2023-01-27 21:16:21,478 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 134 predicate places. [2023-01-27 21:16:21,478 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 192 transitions, 2441 flow [2023-01-27 21:16:21,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 151.66666666666666) internal successors, (3640), 24 states have internal predecessors, (3640), 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) [2023-01-27 21:16:21,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:16:21,479 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:16:21,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-01-27 21:16:21,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-01-27 21:16:21,684 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:16:21,685 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:16:21,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1576090582, now seen corresponding path program 3 times [2023-01-27 21:16:21,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:16:21,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22565517] [2023-01-27 21:16:21,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:16:21,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:16:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:16:22,743 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:16:22,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:16:22,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22565517] [2023-01-27 21:16:22,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22565517] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:16:22,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086479515] [2023-01-27 21:16:22,743 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 21:16:22,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:16:22,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:16:22,757 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 21:16:22,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-01-27 21:16:22,903 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-27 21:16:22,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:16:22,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 25 conjunts are in the unsatisfiable core [2023-01-27 21:16:22,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:16:23,365 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 21:16:23,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:16:26,109 INFO L321 Elim1Store]: treesize reduction 122, result has 73.2 percent of original size [2023-01-27 21:16:26,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 897 treesize of output 1054 [2023-01-27 21:17:26,521 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-27 21:17:26,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086479515] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:17:26,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:17:26,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 5] total 20 [2023-01-27 21:17:26,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684954441] [2023-01-27 21:17:26,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:17:26,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-01-27 21:17:26,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:17:26,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-01-27 21:17:26,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2023-01-27 21:17:26,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 544 [2023-01-27 21:17:26,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 192 transitions, 2441 flow. Second operand has 22 states, 22 states have (on average 149.5) internal successors, (3289), 22 states have internal predecessors, (3289), 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) [2023-01-27 21:17:26,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:17:26,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 544 [2023-01-27 21:17:26,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:17:29,177 INFO L130 PetriNetUnfolder]: 6626/11397 cut-off events. [2023-01-27 21:17:29,177 INFO L131 PetriNetUnfolder]: For 55504/55504 co-relation queries the response was YES. [2023-01-27 21:17:29,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49157 conditions, 11397 events. 6626/11397 cut-off events. For 55504/55504 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 81079 event pairs, 1179 based on Foata normal form. 12/11398 useless extension candidates. Maximal degree in co-relation 47219. Up to 6595 conditions per place. [2023-01-27 21:17:29,231 INFO L137 encePairwiseOnDemand]: 533/544 looper letters, 160 selfloop transitions, 176 changer transitions 61/397 dead transitions. [2023-01-27 21:17:29,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 397 transitions, 4852 flow [2023-01-27 21:17:29,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-01-27 21:17:29,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-01-27 21:17:29,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3711 transitions. [2023-01-27 21:17:29,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2842371323529412 [2023-01-27 21:17:29,235 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 3711 transitions. [2023-01-27 21:17:29,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 3711 transitions. [2023-01-27 21:17:29,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:17:29,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 3711 transitions. [2023-01-27 21:17:29,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 154.625) internal successors, (3711), 24 states have internal predecessors, (3711), 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) [2023-01-27 21:17:29,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 544.0) internal successors, (13600), 25 states have internal predecessors, (13600), 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) [2023-01-27 21:17:29,246 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 544.0) internal successors, (13600), 25 states have internal predecessors, (13600), 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) [2023-01-27 21:17:29,246 INFO L175 Difference]: Start difference. First operand has 163 places, 192 transitions, 2441 flow. Second operand 24 states and 3711 transitions. [2023-01-27 21:17:29,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 397 transitions, 4852 flow [2023-01-27 21:17:29,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 397 transitions, 4314 flow, removed 202 selfloop flow, removed 11 redundant places. [2023-01-27 21:17:29,438 INFO L231 Difference]: Finished difference. Result has 179 places, 238 transitions, 3205 flow [2023-01-27 21:17:29,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=544, PETRI_DIFFERENCE_MINUEND_FLOW=2127, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=3205, PETRI_PLACES=179, PETRI_TRANSITIONS=238} [2023-01-27 21:17:29,439 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 150 predicate places. [2023-01-27 21:17:29,439 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 238 transitions, 3205 flow [2023-01-27 21:17:29,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 149.5) internal successors, (3289), 22 states have internal predecessors, (3289), 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) [2023-01-27 21:17:29,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:17:29,440 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:17:29,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-01-27 21:17:29,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-01-27 21:17:29,645 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:17:29,645 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:17:29,646 INFO L85 PathProgramCache]: Analyzing trace with hash -965021291, now seen corresponding path program 4 times [2023-01-27 21:17:29,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:17:29,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251338593] [2023-01-27 21:17:29,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:17:29,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:17:29,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:17:29,966 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 21:17:29,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:17:29,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251338593] [2023-01-27 21:17:29,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251338593] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:17:29,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472802003] [2023-01-27 21:17:29,967 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-27 21:17:29,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:17:29,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:17:29,982 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 21:17:29,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-01-27 21:17:30,113 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-27 21:17:30,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:17:30,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 12 conjunts are in the unsatisfiable core [2023-01-27 21:17:30,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:17:30,396 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-01-27 21:17:30,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:17:30,932 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:17:30,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 248 treesize of output 254 [2023-01-27 21:17:31,234 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-01-27 21:17:31,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472802003] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:17:31,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:17:31,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2023-01-27 21:17:31,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516222001] [2023-01-27 21:17:31,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:17:31,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-01-27 21:17:31,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:17:31,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-01-27 21:17:31,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2023-01-27 21:17:31,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 544 [2023-01-27 21:17:31,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 238 transitions, 3205 flow. Second operand has 18 states, 18 states have (on average 159.72222222222223) internal successors, (2875), 18 states have internal predecessors, (2875), 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) [2023-01-27 21:17:31,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:17:31,238 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 544 [2023-01-27 21:17:31,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:17:33,673 INFO L130 PetriNetUnfolder]: 8106/13819 cut-off events. [2023-01-27 21:17:33,674 INFO L131 PetriNetUnfolder]: For 58399/58399 co-relation queries the response was YES. [2023-01-27 21:17:33,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59264 conditions, 13819 events. 8106/13819 cut-off events. For 58399/58399 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 99928 event pairs, 4102 based on Foata normal form. 180/13992 useless extension candidates. Maximal degree in co-relation 57563. Up to 7939 conditions per place. [2023-01-27 21:17:33,751 INFO L137 encePairwiseOnDemand]: 538/544 looper letters, 235 selfloop transitions, 44 changer transitions 54/333 dead transitions. [2023-01-27 21:17:33,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 333 transitions, 4593 flow [2023-01-27 21:17:33,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-27 21:17:33,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-01-27 21:17:33,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1823 transitions. [2023-01-27 21:17:33,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3046457219251337 [2023-01-27 21:17:33,753 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1823 transitions. [2023-01-27 21:17:33,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1823 transitions. [2023-01-27 21:17:33,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:17:33,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1823 transitions. [2023-01-27 21:17:33,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 165.72727272727272) internal successors, (1823), 11 states have internal predecessors, (1823), 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) [2023-01-27 21:17:33,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 544.0) internal successors, (6528), 12 states have internal predecessors, (6528), 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) [2023-01-27 21:17:33,758 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 544.0) internal successors, (6528), 12 states have internal predecessors, (6528), 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) [2023-01-27 21:17:33,758 INFO L175 Difference]: Start difference. First operand has 179 places, 238 transitions, 3205 flow. Second operand 11 states and 1823 transitions. [2023-01-27 21:17:33,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 333 transitions, 4593 flow [2023-01-27 21:17:34,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 333 transitions, 4272 flow, removed 57 selfloop flow, removed 12 redundant places. [2023-01-27 21:17:34,070 INFO L231 Difference]: Finished difference. Result has 180 places, 220 transitions, 2813 flow [2023-01-27 21:17:34,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=544, PETRI_DIFFERENCE_MINUEND_FLOW=2909, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2813, PETRI_PLACES=180, PETRI_TRANSITIONS=220} [2023-01-27 21:17:34,070 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 151 predicate places. [2023-01-27 21:17:34,070 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 220 transitions, 2813 flow [2023-01-27 21:17:34,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 159.72222222222223) internal successors, (2875), 18 states have internal predecessors, (2875), 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) [2023-01-27 21:17:34,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:17:34,071 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:17:34,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-01-27 21:17:34,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-01-27 21:17:34,289 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:17:34,289 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:17:34,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1625832884, now seen corresponding path program 5 times [2023-01-27 21:17:34,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:17:34,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431087543] [2023-01-27 21:17:34,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:17:34,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:17:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:17:34,975 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 21:17:34,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:17:34,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431087543] [2023-01-27 21:17:34,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431087543] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:17:34,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573156036] [2023-01-27 21:17:34,975 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-27 21:17:34,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:17:34,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:17:34,977 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 21:17:34,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-01-27 21:17:35,124 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-01-27 21:17:35,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:17:35,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 10 conjunts are in the unsatisfiable core [2023-01-27 21:17:35,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:17:35,436 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-01-27 21:17:35,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:17:36,003 INFO L321 Elim1Store]: treesize reduction 4, result has 91.5 percent of original size [2023-01-27 21:17:36,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 261 treesize of output 263 [2023-01-27 21:17:36,252 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-01-27 21:17:36,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573156036] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:17:36,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:17:36,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 21 [2023-01-27 21:17:36,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406355508] [2023-01-27 21:17:36,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:17:36,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-01-27 21:17:36,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:17:36,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-01-27 21:17:36,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2023-01-27 21:17:36,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 544 [2023-01-27 21:17:36,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 220 transitions, 2813 flow. Second operand has 22 states, 22 states have (on average 159.0) internal successors, (3498), 22 states have internal predecessors, (3498), 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) [2023-01-27 21:17:36,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:17:36,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 544 [2023-01-27 21:17:36,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:17:38,742 INFO L130 PetriNetUnfolder]: 7602/12811 cut-off events. [2023-01-27 21:17:38,742 INFO L131 PetriNetUnfolder]: For 57698/57698 co-relation queries the response was YES. [2023-01-27 21:17:38,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56297 conditions, 12811 events. 7602/12811 cut-off events. For 57698/57698 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 88985 event pairs, 1106 based on Foata normal form. 144/12949 useless extension candidates. Maximal degree in co-relation 53609. Up to 7245 conditions per place. [2023-01-27 21:17:38,814 INFO L137 encePairwiseOnDemand]: 535/544 looper letters, 228 selfloop transitions, 116 changer transitions 42/386 dead transitions. [2023-01-27 21:17:38,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 386 transitions, 4719 flow [2023-01-27 21:17:38,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-01-27 21:17:38,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-01-27 21:17:38,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3476 transitions. [2023-01-27 21:17:38,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30427170868347336 [2023-01-27 21:17:38,818 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3476 transitions. [2023-01-27 21:17:38,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3476 transitions. [2023-01-27 21:17:38,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:17:38,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3476 transitions. [2023-01-27 21:17:38,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 165.52380952380952) internal successors, (3476), 21 states have internal predecessors, (3476), 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) [2023-01-27 21:17:38,826 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 544.0) internal successors, (11968), 22 states have internal predecessors, (11968), 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) [2023-01-27 21:17:38,827 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 544.0) internal successors, (11968), 22 states have internal predecessors, (11968), 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) [2023-01-27 21:17:38,827 INFO L175 Difference]: Start difference. First operand has 180 places, 220 transitions, 2813 flow. Second operand 21 states and 3476 transitions. [2023-01-27 21:17:38,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 386 transitions, 4719 flow [2023-01-27 21:17:39,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 386 transitions, 4611 flow, removed 21 selfloop flow, removed 10 redundant places. [2023-01-27 21:17:39,059 INFO L231 Difference]: Finished difference. Result has 190 places, 232 transitions, 3215 flow [2023-01-27 21:17:39,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=544, PETRI_DIFFERENCE_MINUEND_FLOW=2679, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=3215, PETRI_PLACES=190, PETRI_TRANSITIONS=232} [2023-01-27 21:17:39,059 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 161 predicate places. [2023-01-27 21:17:39,059 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 232 transitions, 3215 flow [2023-01-27 21:17:39,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 159.0) internal successors, (3498), 22 states have internal predecessors, (3498), 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) [2023-01-27 21:17:39,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:17:39,060 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:17:39,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-01-27 21:17:39,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-01-27 21:17:39,265 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:17:39,265 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:17:39,265 INFO L85 PathProgramCache]: Analyzing trace with hash -605202817, now seen corresponding path program 6 times [2023-01-27 21:17:39,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:17:39,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706987433] [2023-01-27 21:17:39,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:17:39,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:17:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:17:40,834 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:17:40,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:17:40,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706987433] [2023-01-27 21:17:40,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706987433] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:17:40,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165198876] [2023-01-27 21:17:40,834 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-27 21:17:40,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:17:40,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:17:40,836 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 21:17:40,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-01-27 21:17:41,079 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-01-27 21:17:41,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:17:41,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 65 conjunts are in the unsatisfiable core [2023-01-27 21:17:41,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:17:41,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:17:41,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:17:41,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:17:41,131 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2023-01-27 21:17:41,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 32 [2023-01-27 21:17:41,228 INFO L350 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 15 treesize of output 11 [2023-01-27 21:17:41,313 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-01-27 21:17:41,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-01-27 21:17:41,398 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-27 21:17:41,398 INFO L350 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 [2023-01-27 21:17:41,492 INFO L350 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 6 treesize of output 5 [2023-01-27 21:17:41,549 INFO L350 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 6 treesize of output 5 [2023-01-27 21:17:41,642 INFO L350 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 6 treesize of output 5 [2023-01-27 21:17:41,709 INFO L350 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 6 treesize of output 5 [2023-01-27 21:17:42,591 INFO L321 Elim1Store]: treesize reduction 56, result has 30.0 percent of original size [2023-01-27 21:17:42,591 INFO L350 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 43 [2023-01-27 21:17:42,626 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:17:42,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:18:30,969 WARN L222 SmtUtils]: Spent 34.60s on a formula simplification. DAG size of input: 231 DAG size of output: 228 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:18:59,853 WARN L222 SmtUtils]: Spent 5.59s on a formula simplification that was a NOOP. DAG size: 253 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:19:44,953 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:19:44,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 57 [2023-01-27 21:19:44,973 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:19:44,974 INFO L350 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 26870 treesize of output 25866 [2023-01-27 21:19:46,334 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:19:46,334 INFO L350 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 6454 treesize of output 6279 [2023-01-27 21:19:46,435 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:19:46,436 INFO L350 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 6262 treesize of output 5895 [2023-01-27 21:19:46,537 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:19:46,538 INFO L350 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 5878 treesize of output 4359 [2023-01-27 21:19:46,650 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:19:46,650 INFO L350 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 4342 treesize of output 3591 [2023-01-27 21:19:50,101 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:19:50,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 102 [2023-01-27 21:19:50,177 INFO L321 Elim1Store]: treesize reduction 5, result has 93.6 percent of original size [2023-01-27 21:19:50,178 INFO L350 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 431804 treesize of output 415420 [2023-01-27 21:19:52,459 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 21:19:52,485 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:19:52,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 6652 treesize of output 6506 [2023-01-27 21:19:52,589 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 21:19:52,613 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:19:52,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 6656 treesize of output 5892 [2023-01-27 21:19:52,724 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 21:19:52,748 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:19:52,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 5832 treesize of output 4244 [2023-01-27 21:19:52,884 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 21:19:52,909 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:19:52,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 4085 treesize of output 3733 [2023-01-27 21:20:31,657 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:20:31,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 57 [2023-01-27 21:20:31,669 INFO L321 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2023-01-27 21:20:31,670 INFO L350 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 1670 treesize of output 1607 [2023-01-27 21:20:31,751 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-01-27 21:20:31,752 INFO L350 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 393 treesize of output 289 [2023-01-27 21:20:31,760 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 21:20:31,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 112 [2023-01-27 21:20:31,769 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 21:20:31,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 99 [2023-01-27 21:20:31,783 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-01-27 21:20:31,784 INFO L350 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 150 treesize of output 98 [2023-01-27 21:20:31,932 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:20:31,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 102 [2023-01-27 21:20:31,994 INFO L321 Elim1Store]: treesize reduction 5, result has 93.6 percent of original size [2023-01-27 21:20:31,995 INFO L350 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 14292 treesize of output 13816 [2023-01-27 21:20:32,887 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 21:20:32,917 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:20:32,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 6862 treesize of output 6098 [2023-01-27 21:20:33,024 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 21:20:33,053 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:20:33,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 6038 treesize of output 5686 [2023-01-27 21:20:33,165 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 21:20:33,197 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:20:33,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 5626 treesize of output 4038 [2023-01-27 21:20:33,313 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 21:20:33,338 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:20:33,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 3879 treesize of output 3733 [2023-01-27 21:21:02,342 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:21:02,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 57 [2023-01-27 21:21:02,354 INFO L321 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2023-01-27 21:21:02,354 INFO L350 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 1670 treesize of output 1607 [2023-01-27 21:21:02,387 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-01-27 21:21:02,387 INFO L350 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 393 treesize of output 289 [2023-01-27 21:21:02,396 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 21:21:02,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 112 [2023-01-27 21:21:02,406 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 21:21:02,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 99 [2023-01-27 21:21:02,419 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-01-27 21:21:02,420 INFO L350 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 150 treesize of output 98 [2023-01-27 21:21:12,146 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:21:12,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165198876] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:21:12,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:21:12,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 43 [2023-01-27 21:21:12,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378089343] [2023-01-27 21:21:12,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:21:12,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-01-27 21:21:12,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:21:12,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-01-27 21:21:12,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=1544, Unknown=24, NotChecked=0, Total=1980 [2023-01-27 21:21:12,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 544 [2023-01-27 21:21:12,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 232 transitions, 3215 flow. Second operand has 45 states, 45 states have (on average 129.86666666666667) internal successors, (5844), 45 states have internal predecessors, (5844), 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) [2023-01-27 21:21:12,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:21:12,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 544 [2023-01-27 21:21:12,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:21:12,706 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse375 (* 4 c_~manager_front~0))) (let ((.cse376 (* c_~manager_back~0 4)) (.cse374 (select |c_#memory_int| c_~manager~0.base)) (.cse87 (+ .cse375 c_~manager~0.offset)) (.cse38 (= c_~client_state~0 0))) (let ((.cse47 (not .cse38)) (.cse10 (< c_~manager_back~0 0)) (.cse11 (<= c_~manager_size~0 c_~manager_back~0)) (.cse40 (= c_~client_state~0 1)) (.cse109 (* c_~node_front~0 4)) (.cse84 (* c_~node_back~0 4)) (.cse107 (= 2 c_~manager_state~0)) (.cse44 (select .cse374 .cse87)) (.cse64 (+ c_~manager~0.offset .cse376)) (.cse71 (+ c_~manager~0.offset .cse376 4)) (.cse69 (+ .cse375 c_~manager~0.offset 4))) (let ((.cse242 (select .cse374 .cse69)) (.cse14 (<= c_~node_back~0 c_~node_front~0)) (.cse359 (select .cse374 .cse71)) (.cse52 (select .cse374 .cse64)) (.cse370 (+ c_~manager_back~0 1)) (.cse177 (+ c_~manager_front~0 1)) (.cse34 (<= c_~manager_back~0 c_~manager_front~0)) (.cse28 (< c_~manager_front~0 0)) (.cse35 (<= c_~manager_size~0 c_~manager_front~0)) (.cse31 (= c_~ok~0 .cse44)) (.cse32 (not .cse107)) (.cse176 (not (= (mod (* c_~safe~0 255) 256) 0))) (.cse53 (+ .cse84 c_~node~0.offset)) (.cse373 (select |c_#memory_int| c_~node~0.base)) (.cse317 (+ .cse109 c_~node~0.offset)) (.cse29 (= c_~manager_state~0 1)) (.cse30 (= c_~manager_state~0 0)) (.cse110 (= 3 c_~manager_state~0)) (.cse299 (< c_~client_size~0 2)) (.cse41 (not .cse40)) (.cse179 (or .cse38 .cse40)) (.cse180 (or .cse47 .cse10 .cse11))) (let ((.cse298 (and (or .cse299 .cse41) .cse179 .cse180)) (.cse19 (or .cse29 .cse30 .cse107 .cse110)) (.cse15 (= c_~update~0 (select .cse373 .cse317))) (.cse37 (< c_~node_back~0 0)) (.cse17 (not (= (select .cse373 .cse53) c_~update~0))) (.cse33 (or .cse107 .cse110 .cse176)) (.cse24 (or .cse34 .cse28 .cse35 .cse31 .cse32)) (.cse0 (= c_~node_state~0 1)) (.cse73 (<= c_~manager_back~0 .cse177)) (.cse1 (= c_~node_state~0 0)) (.cse58 (<= c_~manager_size~0 .cse177)) (.cse50 (< c_~client_size~0 1)) (.cse142 (forall ((v_ArrVal_836 (Array Int Int))) (let ((.cse372 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836) c_~manager~0.base))) (= (select .cse372 .cse69) (select .cse372 .cse64))))) (.cse245 (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int))) (let ((.cse371 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836) c_~manager~0.base))) (= (select .cse371 .cse64) (select .cse371 .cse69))))) (.cse65 (<= c_~manager_size~0 .cse370)) (.cse48 (forall ((~node~0.base Int)) (not (= .cse52 (select (select |c_#memory_int| ~node~0.base) .cse53))))) (.cse140 (forall ((~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (not (= .cse359 (select (select |c_#memory_int| ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset))))))) (.cse26 (<= .cse370 c_~manager_front~0)) (.cse115 (or .cse29 .cse30 .cse107 .cse110 .cse14)) (.cse139 (= .cse242 .cse52)) (.cse133 (forall ((~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (not (= .cse52 (select (select |c_#memory_int| ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset)))) (< ~client_back~0 0)))) (.cse175 (= .cse242 c_~ok~0)) (.cse174 (forall ((~node~0.base Int)) (not (= c_~update~0 (select (select |c_#memory_int| ~node~0.base) .cse53))))) (.cse104 (<= (+ c_~node_back~0 1) c_~node_front~0)) (.cse16 (not .cse29)) (.cse18 (<= c_~node_size~0 c_~node_back~0)) (.cse25 (= c_~update~0 .cse44)) (.cse27 (not .cse30)) (.cse20 (not (= (select (select |c_#memory_int| c_~client~0.base) (+ (* c_~client_back~0 4) c_~client~0.offset)) c_~ok~0))) (.cse21 (< c_~client_back~0 0)) (.cse22 (not .cse110)) (.cse23 (<= c_~client_size~0 c_~client_back~0))) (let ((.cse2 (or .cse20 .cse21 .cse22 .cse176 .cse23)) (.cse3 (or .cse25 .cse34 .cse27 .cse28 .cse35)) (.cse9 (let ((.cse368 (forall ((~node~0.base Int)) (let ((.cse369 (select |c_#memory_int| ~node~0.base))) (or (= c_~update~0 (select .cse369 .cse317)) (not (= c_~update~0 (select .cse369 .cse53)))))))) (and (or .cse29 .cse30 (forall ((~node~0.base Int)) (= c_~update~0 (select (select |c_#memory_int| ~node~0.base) .cse317))) .cse107 .cse110 .cse14) (or .cse34 .cse20 .cse21 .cse22 .cse368 .cse28 .cse18 .cse14 .cse23) (or .cse34 .cse104 .cse27 .cse175 .cse174 .cse28 .cse18) (or .cse34 .cse20 .cse104 .cse21 .cse16 .cse368 .cse28 .cse18 .cse23)))) (.cse59 (let ((.cse363 (forall ((~node~0.base Int)) (let ((.cse367 (select |c_#memory_int| ~node~0.base))) (= (select .cse367 .cse53) (select .cse367 .cse317)))))) (and (or .cse47 .cse65 (let ((.cse360 (forall ((~node~0.base Int)) (let ((.cse361 (select |c_#memory_int| ~node~0.base))) (or (not (= .cse52 (select .cse361 .cse53))) (= .cse52 (select .cse361 .cse317))))))) (and (or .cse29 .cse30 .cse107 .cse110 .cse14 (forall ((~node~0.base Int)) (= .cse52 (select (select |c_#memory_int| ~node~0.base) .cse317)))) (or .cse104 .cse26 .cse27 (= .cse359 .cse242) .cse28 .cse18 .cse48) (or .cse360 .cse140 .cse26 .cse22 .cse28 .cse18 .cse14) (or .cse360 .cse104 .cse140 .cse26 .cse16 .cse28 .cse18))) .cse10) (or .cse41 .cse10 .cse11 (let ((.cse362 (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< c_~client_size~0 (+ v_~client_front~0_112 1)) (< v_~client_front~0_112 1) (not (= .cse52 (select (select |c_#memory_int| ~client~0.base) (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))))))) (.cse364 (and (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse365 (select |c_#memory_int| ~client~0.base))) (or (not (= .cse52 (select .cse365 (+ (* ~client_back~0 4) ~client~0.offset)))) (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (not (= .cse52 (select .cse365 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)))) (<= (+ ~client_back~0 1) v_~client_front~0_112)))))) (< ~client_back~0 0))) (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse366 (select |c_#memory_int| ~client~0.base))) (or (not (= .cse52 (select .cse366 (+ (* ~client_back~0 4) ~client~0.offset)))) (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (= .cse52 (select .cse366 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))) (<= (+ ~client_back~0 1) v_~client_front~0_112)))))) (< ~client_back~0 0)))))) (and (or .cse29 .cse30 .cse107 .cse110 .cse14 .cse362) (or .cse139 .cse34 .cse104 .cse27 .cse28 .cse18 .cse362) (or .cse34 .cse104 .cse16 .cse28 .cse18 .cse363 .cse364) (or .cse34 .cse22 .cse28 .cse18 .cse14 .cse363 .cse364)))) (or (and .cse115 (or .cse139 .cse34 .cse104 .cse27 .cse28 .cse18) (or .cse34 .cse22 .cse28 .cse18 .cse14 .cse133 .cse363) (or .cse34 .cse104 .cse16 .cse28 .cse18 .cse133 .cse363)) .cse38 .cse10 .cse11 .cse40)))) (.cse60 (and (or .cse38 (let ((.cse335 (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int) (~node~0.base Int)) (let ((.cse337 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (let ((.cse336 (select .cse337 ~node~0.base))) (= (select .cse336 .cse317) (select .cse336 .cse53))) (not (= (select (select .cse337 c_~manager~0.base) .cse64) (select (select .cse337 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset))))))))) (and .cse115 (or .cse34 .cse104 .cse27 .cse245 .cse28 .cse18) (or .cse34 .cse22 .cse28 .cse18 .cse14 .cse335) (or .cse34 .cse104 .cse16 .cse28 .cse18 .cse335))) .cse10 .cse11 .cse40) (or .cse47 .cse65 .cse10 (let ((.cse338 (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int) (~node~0.base Int)) (let ((.cse345 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse344 (select .cse345 c_~manager~0.base))) (let ((.cse342 (select .cse344 .cse64)) (.cse343 (select .cse345 ~node~0.base))) (or (= .cse342 (select .cse343 .cse317)) (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (not (= .cse342 (select .cse343 .cse53))) (not (= (select .cse344 .cse71) (select (select .cse345 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset))))))))))) (and (or .cse104 .cse338 .cse26 .cse16 .cse28 .cse18) (or .cse338 .cse26 .cse22 .cse28 .cse18 .cse14) (or .cse29 .cse30 (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse339 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse339 c_~manager~0.base) .cse64) (select (select .cse339 ~node~0.base) .cse317)))) .cse107 .cse110 .cse14) (or .cse104 .cse26 .cse27 .cse28 .cse18 (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse341 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse340 (select .cse341 c_~manager~0.base))) (or (not (= (select .cse340 .cse64) (select (select .cse341 ~node~0.base) .cse53))) (= (select .cse340 .cse71) (select .cse340 .cse69)))))))))) (or .cse41 .cse10 .cse11 (let ((.cse346 (and (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse353 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse351 (select (select .cse353 c_~manager~0.base) .cse64)) (.cse352 (select .cse353 ~client~0.base))) (or (forall ((v_~client_front~0_112 Int)) (or (= .cse351 (select .cse352 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))) (< v_~client_front~0_112 1) (<= (+ ~client_back~0 1) v_~client_front~0_112))) (not (= .cse351 (select .cse352 (+ (* ~client_back~0 4) ~client~0.offset))))))))) (let ((.cse354 (select .cse353 ~node~0.base))) (= (select .cse354 .cse317) (select .cse354 .cse53)))))) (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse357 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse355 (select (select .cse357 c_~manager~0.base) .cse64)) (.cse356 (select .cse357 ~client~0.base))) (or (forall ((v_~client_front~0_112 Int)) (or (not (= .cse355 (select .cse356 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)))) (< v_~client_front~0_112 1) (<= (+ ~client_back~0 1) v_~client_front~0_112))) (not (= .cse355 (select .cse356 (+ (* ~client_back~0 4) ~client~0.offset))))))))) (let ((.cse358 (select .cse357 ~node~0.base))) (= (select .cse358 .cse317) (select .cse358 .cse53))))))))) (and (or .cse34 .cse104 .cse346 .cse16 .cse28 .cse18) (or .cse34 .cse346 .cse22 .cse28 .cse18 .cse14) (or (forall ((v_~client_front~0_112 Int) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int)) (let ((.cse348 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse349 (select .cse348 c_~manager~0.base))) (let ((.cse347 (select .cse349 .cse64))) (or (< c_~client_size~0 (+ v_~client_front~0_112 1)) (not (= .cse347 (select (select .cse348 ~client~0.base) (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)))) (< v_~client_front~0_112 1) (= .cse347 (select .cse349 .cse69))))))) .cse34 .cse104 .cse27 .cse28 .cse18) (or .cse29 .cse30 (forall ((v_~client_front~0_112 Int) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int)) (or (< c_~client_size~0 (+ v_~client_front~0_112 1)) (not (let ((.cse350 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse350 c_~manager~0.base) .cse64) (select (select .cse350 ~client~0.base) (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))))) (< v_~client_front~0_112 1))) .cse107 .cse110 .cse14)))))) (.cse55 (and (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< v_~client_front~0_112 1) (not (let ((.cse333 (select |c_#memory_int| ~client~0.base))) (= (select .cse333 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) (select .cse333 (+ (* ~client_back~0 4) ~client~0.offset))))) (<= (+ ~client_back~0 1) v_~client_front~0_112))) (< ~client_back~0 0))) (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< v_~client_front~0_112 1) (let ((.cse334 (select |c_#memory_int| ~client~0.base))) (= (select .cse334 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) (select .cse334 (+ (* ~client_back~0 4) ~client~0.offset)))) (<= (+ ~client_back~0 1) v_~client_front~0_112))) (< ~client_back~0 0))))) (.cse36 (and (or .cse41 (let ((.cse308 (and (forall ((v_ArrVal_836 (Array Int Int)) (~node~0.base Int)) (let ((.cse315 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse314 (select .cse315 ~client~0.base)) (.cse313 (select (select .cse315 c_~manager~0.base) .cse64))) (or (not (= .cse313 (select .cse314 (+ (* ~client_back~0 4) ~client~0.offset)))) (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (= (select .cse314 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) .cse313) (<= (+ ~client_back~0 1) v_~client_front~0_112)))))) (< ~client_back~0 0))) (let ((.cse316 (select .cse315 ~node~0.base))) (= (select .cse316 .cse53) (select .cse316 .cse317)))))) (forall ((v_ArrVal_836 (Array Int Int)) (~node~0.base Int)) (let ((.cse320 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse319 (select .cse320 ~client~0.base)) (.cse318 (select (select .cse320 c_~manager~0.base) .cse64))) (or (not (= .cse318 (select .cse319 (+ (* ~client_back~0 4) ~client~0.offset)))) (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (not (= (select .cse319 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) .cse318)) (<= (+ ~client_back~0 1) v_~client_front~0_112)))))) (< ~client_back~0 0))) (let ((.cse321 (select .cse320 ~node~0.base))) (= (select .cse321 .cse53) (select .cse321 .cse317))))))))) (and (or .cse34 .cse22 .cse28 .cse18 .cse14 .cse308) (or .cse34 .cse104 .cse16 .cse28 .cse18 .cse308) (or .cse34 .cse104 .cse27 (forall ((v_~client_front~0_112 Int) (v_ArrVal_836 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int)) (let ((.cse309 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse311 (select .cse309 c_~manager~0.base))) (let ((.cse310 (select .cse311 .cse64))) (or (< c_~client_size~0 (+ v_~client_front~0_112 1)) (< v_~client_front~0_112 1) (not (= (select (select .cse309 ~client~0.base) (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) .cse310)) (= (select .cse311 .cse69) .cse310)))))) .cse28 .cse18) (or .cse29 .cse30 .cse107 (forall ((v_~client_front~0_112 Int) (v_ArrVal_836 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int)) (or (< c_~client_size~0 (+ v_~client_front~0_112 1)) (< v_~client_front~0_112 1) (not (let ((.cse312 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse312 ~client~0.base) (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) (select (select .cse312 c_~manager~0.base) .cse64)))))) .cse110 .cse14))) .cse10 .cse11) (or .cse38 (let ((.cse322 (forall ((v_ArrVal_836 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int) (~node~0.base Int)) (let ((.cse323 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (<= c_~client_size~0 ~client_back~0) (not (= (select (select .cse323 c_~manager~0.base) .cse64) (select (select .cse323 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset)))) (< ~client_back~0 0) (let ((.cse324 (select .cse323 ~node~0.base))) (= (select .cse324 .cse53) (select .cse324 .cse317)))))))) (and (or .cse34 .cse104 .cse16 .cse322 .cse28 .cse18) .cse115 (or .cse34 .cse22 .cse322 .cse28 .cse18 .cse14) (or .cse34 .cse104 .cse27 .cse142 .cse28 .cse18))) .cse10 .cse11 .cse40) (or .cse47 .cse65 (let ((.cse327 (forall ((v_ArrVal_836 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int) (~node~0.base Int)) (let ((.cse331 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse332 (select .cse331 c_~manager~0.base))) (let ((.cse330 (select .cse331 ~node~0.base)) (.cse329 (select .cse332 .cse64))) (or (<= c_~client_size~0 ~client_back~0) (= .cse329 (select .cse330 .cse317)) (< ~client_back~0 0) (not (= (select (select .cse331 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset)) (select .cse332 .cse71))) (not (= (select .cse330 .cse53) .cse329))))))))) (and (or .cse104 .cse26 (forall ((v_ArrVal_836 (Array Int Int)) (~node~0.base Int)) (let ((.cse326 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse325 (select .cse326 c_~manager~0.base))) (or (= (select .cse325 .cse69) (select .cse325 .cse71)) (not (= (select (select .cse326 ~node~0.base) .cse53) (select .cse325 .cse64))))))) .cse27 .cse28 .cse18) (or .cse26 .cse327 .cse22 .cse28 .cse18 .cse14) (or .cse29 .cse30 (forall ((v_ArrVal_836 (Array Int Int)) (~node~0.base Int)) (let ((.cse328 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse328 c_~manager~0.base) .cse64) (select (select .cse328 ~node~0.base) .cse317)))) .cse107 .cse110 .cse14) (or .cse104 .cse26 .cse327 .cse16 .cse28 .cse18))) .cse10))) (.cse62 (or .cse0 .cse73 .cse1 .cse58 .cse50)) (.cse4 (or (and .cse33 .cse24) .cse29 .cse30)) (.cse5 (or .cse37 .cse16 .cse17 .cse18 .cse176)) (.cse6 (< c_~node_front~0 0)) (.cse7 (<= c_~node_size~0 c_~node_front~0)) (.cse8 (not (= .cse52 c_~ok~0))) (.cse243 (and (or (and .cse19 (or .cse34 .cse27 .cse17 .cse28 .cse18) (or .cse34 .cse20 .cse21 .cse28 .cse32 .cse23)) .cse15 .cse14) (or .cse104 .cse26 .cse16 .cse17 .cse28 .cse18 .cse31))) (.cse56 (or .cse38 .cse73 .cse40)) (.cse57 (or .cse299 .cse41 .cse73)) (.cse49 (or .cse29 .cse30 .cse107 .cse298 .cse110)) (.cse240 (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse12 (not .cse0)) (.cse13 (not .cse1))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5)) (or .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse6 .cse7 .cse14 (and .cse3 (or .cse15 (and (or .cse16 .cse17 .cse18) .cse19 (or .cse20 .cse21 .cse22 .cse23))) .cse24)) (or .cse8 .cse10 .cse11 (and .cse2 (or .cse25 .cse26 .cse27 .cse28) (or .cse29 .cse30 (and (or .cse26 .cse28 .cse31 .cse32) .cse33)) .cse5) .cse12) .cse2 .cse3 (or .cse20 .cse21 (and (or .cse0 .cse25 .cse34 .cse28 .cse35 .cse1) (or .cse13 .cse25 .cse6 .cse7 .cse26 .cse8 .cse28 .cse14 .cse11) (or .cse25 .cse6 .cse7 .cse26 .cse8 .cse28 .cse14 .cse11 .cse12)) .cse22 .cse23) (or .cse6 .cse7 .cse36 .cse12) (or .cse0 (and (or .cse29 .cse30 (and (or .cse34 .cse20 .cse21 .cse28 .cse35 .cse31 .cse32 .cse23) .cse33)) (or .cse25 .cse37 .cse34 .cse27 .cse17 .cse28 .cse35 .cse18) (or .cse37 .cse34 .cse16 .cse17 .cse28 .cse35 .cse18 .cse31)) .cse1) (or .cse13 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or (and (or .cse37 .cse16 (let ((.cse39 (forall ((~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (= (select (select |c_#memory_int| ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset)) .cse44))))) (and (or .cse34 .cse38 .cse39 .cse40) (or .cse34 .cse41 (and (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse42 (select |c_#memory_int| ~client~0.base))) (let ((.cse43 (select .cse42 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (not (= (select .cse42 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) .cse43)) (<= (+ ~client_back~0 1) v_~client_front~0_112))) (= .cse43 .cse44))))) (< ~client_back~0 0))) (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse46 (select |c_#memory_int| ~client~0.base))) (let ((.cse45 (select .cse46 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (= .cse45 .cse44) (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (= (select .cse46 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) .cse45) (<= (+ ~client_back~0 1) v_~client_front~0_112))))))))))) (or .cse39 .cse26 .cse47 .cse11 .cse48))) .cse28 .cse35 .cse18) .cse49 (or .cse37 (let ((.cse54 (forall ((~node~0.base Int)) (= (select (select |c_#memory_int| ~node~0.base) .cse53) .cse44)))) (and (or .cse26 .cse47 .cse11 .cse50 (forall ((~node~0.base Int)) (let ((.cse51 (select (select |c_#memory_int| ~node~0.base) .cse53))) (or (= .cse51 .cse44) (not (= .cse52 .cse51)))))) (or .cse34 .cse54 .cse41 .cse55) (or .cse34 .cse38 .cse54 .cse50 .cse40))) .cse22 .cse28 .cse35 .cse18) (or .cse37 (and .cse56 .cse57 (or .cse34 .cse47 .cse11 .cse48)) .cse27 .cse28 .cse18 .cse58)) .cse0 .cse1) (or .cse13 .cse59 .cse6 .cse7) (or .cse13 .cse6 .cse60 .cse7) (or .cse59 .cse6 .cse7 .cse12) (or .cse6 .cse60 .cse7 .cse12) (or (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse67 (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int))) (let ((.cse132 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836) c_~manager~0.base))) (= (select .cse132 .cse69) (select .cse132 .cse64)))))) (let ((.cse82 (and (or .cse47 .cse65 (let ((.cse103 (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int) (~node~0.base Int)) (let ((.cse113 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse114 (select .cse113 c_~manager~0.base))) (let ((.cse111 (select .cse113 ~node~0.base)) (.cse112 (select .cse114 .cse64))) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (not (= (select .cse111 (+ .cse84 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse112)) (not (= (select (select .cse113 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset)) (select .cse114 .cse71))) (= (select .cse111 (+ .cse109 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse112)))))))) (and (or .cse26 .cse22 .cse28 .cse18 .cse14 .cse103) (or .cse104 (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse106 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse105 (select .cse106 c_~manager~0.base))) (or (= (select .cse105 .cse69) (select .cse105 .cse71)) (not (= (select (select .cse106 ~node~0.base) (+ .cse84 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse105 .cse64))))))) .cse26 .cse27 .cse28 .cse18) (or .cse104 .cse26 .cse16 .cse28 .cse18 .cse103) (or .cse29 .cse30 .cse107 (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse108 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse108 ~node~0.base) (+ .cse109 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select .cse108 c_~manager~0.base) .cse64)))) .cse110 .cse14))) .cse10) (or .cse38 (let ((.cse116 (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int) (~node~0.base Int)) (let ((.cse118 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (let ((.cse117 (select .cse118 ~node~0.base))) (= (select .cse117 (+ .cse109 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse117 (+ .cse84 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= (select (select .cse118 c_~manager~0.base) .cse64) (select (select .cse118 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset))))))))) (and .cse115 (or .cse67 .cse34 .cse104 .cse27 .cse28 .cse18) (or .cse34 .cse104 .cse116 .cse16 .cse28 .cse18) (or .cse34 .cse116 .cse22 .cse28 .cse18 .cse14))) .cse10 .cse11 .cse40) (or .cse41 .cse10 .cse11 (let ((.cse120 (and (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse126 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse124 (select (select .cse126 c_~manager~0.base) .cse64)) (.cse125 (select .cse126 ~client~0.base))) (or (not (= .cse124 (select .cse125 (+ (* ~client_back~0 4) ~client~0.offset)))) (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (not (= .cse124 (select .cse125 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)))) (<= (+ ~client_back~0 1) v_~client_front~0_112)))))) (< ~client_back~0 0))) (let ((.cse127 (select .cse126 ~node~0.base))) (= (select .cse127 (+ .cse109 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse127 (+ .cse84 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse129 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (let ((.cse128 (select .cse129 ~node~0.base))) (= (select .cse128 (+ .cse109 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse128 (+ .cse84 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse130 (select (select .cse129 c_~manager~0.base) .cse64)) (.cse131 (select .cse129 ~client~0.base))) (or (not (= .cse130 (select .cse131 (+ (* ~client_back~0 4) ~client~0.offset)))) (forall ((v_~client_front~0_112 Int)) (or (= .cse130 (select .cse131 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))) (< v_~client_front~0_112 1) (<= (+ ~client_back~0 1) v_~client_front~0_112)))))))))))))) (and (or .cse29 .cse30 .cse107 .cse110 .cse14 (forall ((v_~client_front~0_112 Int) (v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int)) (or (< c_~client_size~0 (+ v_~client_front~0_112 1)) (< v_~client_front~0_112 1) (not (let ((.cse119 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse119 c_~manager~0.base) .cse64) (select (select .cse119 ~client~0.base) (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)))))))) (or .cse34 .cse104 .cse16 .cse28 .cse18 .cse120) (or .cse34 .cse104 .cse27 (forall ((v_ArrVal_834 (Array Int Int)) (v_~client_front~0_112 Int) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int)) (let ((.cse123 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse121 (select .cse123 c_~manager~0.base))) (let ((.cse122 (select .cse121 .cse64))) (or (< c_~client_size~0 (+ v_~client_front~0_112 1)) (< v_~client_front~0_112 1) (= (select .cse121 .cse69) .cse122) (not (= .cse122 (select (select .cse123 ~client~0.base) (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))))))))) .cse28 .cse18) (or .cse34 .cse22 .cse28 .cse18 .cse14 .cse120))))))) (and (or .cse28 (and (or .cse38 (let ((.cse61 (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (not (let ((.cse63 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse63 c_~manager~0.base) .cse64) (select (select .cse63 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset))))))))) (and (or .cse34 .cse6 .cse61 .cse7 .cse14 .cse11 .cse12) (or .cse13 .cse34 .cse6 .cse61 .cse7 .cse14 .cse11) .cse62)) .cse40) (or .cse47 (let ((.cse66 (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int)) (let ((.cse70 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse68 (select .cse70 c_~manager~0.base))) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (= (select .cse68 .cse69) (select .cse68 .cse64)) (not (= (select (select .cse70 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset)) (select .cse68 .cse71))))))))) (and (or .cse13 .cse6 .cse7 .cse26 .cse65 .cse66 .cse14) (or .cse6 .cse7 .cse26 .cse65 .cse66 .cse14 .cse12) (or .cse67 .cse0 .cse34 .cse1 .cse50))) .cse11) (or .cse41 (let ((.cse72 (and (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse76 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse78 (select .cse76 ~client~0.base))) (let ((.cse77 (select .cse78 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (not (= (select (select .cse76 c_~manager~0.base) .cse64) .cse77)) (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (<= (+ ~client_back~0 1) v_~client_front~0_112) (not (= .cse77 (select .cse78 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))))))))))))) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse79 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse81 (select .cse79 ~client~0.base))) (let ((.cse80 (select .cse81 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (not (= (select (select .cse79 c_~manager~0.base) .cse64) .cse80)) (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (= .cse80 (select .cse81 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))) (<= (+ ~client_back~0 1) v_~client_front~0_112)))))))) (< ~client_back~0 0)))))) (and (or .cse13 .cse34 .cse6 .cse7 .cse14 .cse11 .cse72) (or .cse34 .cse6 .cse7 .cse14 .cse11 .cse12 .cse72) (or .cse0 .cse73 (and (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< v_~client_front~0_112 1) (<= (+ ~client_back~0 1) v_~client_front~0_112) (not (let ((.cse74 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836) ~client~0.base))) (= (select .cse74 (+ (* ~client_back~0 4) ~client~0.offset)) (select .cse74 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))))))))) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< v_~client_front~0_112 1) (let ((.cse75 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836) ~client~0.base))) (= (select .cse75 (+ (* ~client_back~0 4) ~client~0.offset)) (select .cse75 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)))) (<= (+ ~client_back~0 1) v_~client_front~0_112)))))) .cse1 .cse58))))) .cse32) (or .cse13 .cse6 .cse7 .cse82) (or .cse0 .cse1 (and (or .cse37 .cse27 .cse28 .cse18 (and .cse56 .cse57 (or .cse34 .cse47 .cse11 (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (not (let ((.cse83 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse83 ~node~0.base) (+ .cse84 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select .cse83 c_~manager~0.base) .cse64))))))) .cse58) (or .cse37 (and (or .cse26 (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int) (~node~0.base Int)) (let ((.cse85 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse86 (select .cse85 c_~manager~0.base))) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (not (= (select (select .cse85 ~node~0.base) (+ .cse84 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse86 .cse64))) (= (select .cse86 .cse87) (select (select .cse85 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset))))))) .cse47 .cse11) (or .cse34 .cse41 (and (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse88 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse90 (select .cse88 ~client~0.base))) (let ((.cse89 (select .cse90 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (= (select (select .cse88 c_~manager~0.base) .cse87) .cse89) (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (= .cse89 (select .cse90 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))) (<= (+ ~client_back~0 1) v_~client_front~0_112)))))))))) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse93 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse92 (select .cse93 ~client~0.base))) (let ((.cse91 (select .cse92 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (<= (+ ~client_back~0 1) v_~client_front~0_112) (not (= .cse91 (select .cse92 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)))))) (= (select (select .cse93 c_~manager~0.base) .cse87) .cse91)))))))))) (or .cse34 .cse38 (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (let ((.cse94 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse94 c_~manager~0.base) .cse87) (select (select .cse94 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset)))))) .cse40)) .cse16 .cse28 .cse35 .cse18) (or .cse37 (and (or .cse34 .cse41 (and (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse96 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< v_~client_front~0_112 1) (let ((.cse95 (select .cse96 ~client~0.base))) (= (select .cse95 (+ (* ~client_back~0 4) ~client~0.offset)) (select .cse95 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)))) (<= (+ ~client_back~0 1) v_~client_front~0_112))))) (= (select (select .cse96 c_~manager~0.base) .cse87) (select (select .cse96 ~node~0.base) (+ .cse84 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse98 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< v_~client_front~0_112 1) (<= (+ ~client_back~0 1) v_~client_front~0_112) (not (let ((.cse97 (select .cse98 ~client~0.base))) (= (select .cse97 (+ (* ~client_back~0 4) ~client~0.offset)) (select .cse97 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))))))))) (= (select (select .cse98 c_~manager~0.base) .cse87) (select (select .cse98 ~node~0.base) (+ .cse84 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (or .cse26 (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse101 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse100 (select .cse101 c_~manager~0.base)) (.cse99 (select (select .cse101 ~node~0.base) (+ .cse84 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (= .cse99 (select .cse100 .cse64))) (= (select .cse100 .cse87) .cse99))))) .cse47 .cse11 .cse50) (or .cse34 .cse38 (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse102 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse102 c_~manager~0.base) .cse87) (select (select .cse102 ~node~0.base) (+ .cse84 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) .cse50 .cse40)) .cse22 .cse28 .cse35 .cse18) .cse49)) (or .cse6 .cse7 .cse82 .cse12))))) (or .cse28 (and (or .cse38 (and (or .cse34 .cse6 .cse7 .cse14 .cse11 .cse133 .cse12) (or .cse13 .cse34 .cse6 .cse7 .cse14 .cse11 .cse133) .cse62) .cse40) (or (let ((.cse134 (and (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse136 (select |c_#memory_int| ~client~0.base))) (let ((.cse135 (select .cse136 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (not (= .cse52 .cse135)) (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (= (select .cse136 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) .cse135) (<= (+ ~client_back~0 1) v_~client_front~0_112))))))))) (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse138 (select |c_#memory_int| ~client~0.base))) (let ((.cse137 (select .cse138 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (not (= .cse52 .cse137)) (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (not (= (select .cse138 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) .cse137)) (<= (+ ~client_back~0 1) v_~client_front~0_112)))))))))))) (and (or .cse13 .cse34 .cse6 .cse7 .cse134 .cse14 .cse11) (or .cse34 .cse6 .cse7 .cse134 .cse14 .cse11 .cse12) (or .cse0 .cse73 .cse55 .cse1 .cse58))) .cse41) (or .cse47 .cse11 (and (or .cse139 .cse13 .cse6 .cse140 .cse7 .cse26 .cse65 .cse14) (or .cse139 .cse0 .cse34 .cse1 .cse50) (or .cse139 .cse6 .cse140 .cse7 .cse26 .cse65 .cse14 .cse12)))) .cse32) (or .cse28 .cse32 (and (or (let ((.cse141 (forall ((v_ArrVal_836 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int)) (let ((.cse143 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse144 (select .cse143 c_~manager~0.base))) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (not (= (select (select .cse143 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset)) (select .cse144 .cse71))) (= (select .cse144 .cse69) (select .cse144 .cse64)))))))) (and (or .cse13 .cse6 .cse7 .cse26 .cse141 .cse65 .cse14) (or .cse0 .cse34 .cse142 .cse1 .cse50) (or .cse6 .cse7 .cse26 .cse141 .cse65 .cse14 .cse12))) .cse47 .cse11) (or (let ((.cse145 (forall ((v_ArrVal_836 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (not (let ((.cse146 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse146 c_~manager~0.base) .cse64) (select (select .cse146 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset))))) (< ~client_back~0 0))))) (and (or .cse34 .cse6 .cse145 .cse7 .cse14 .cse11 .cse12) (or .cse13 .cse34 .cse6 .cse145 .cse7 .cse14 .cse11) .cse62)) .cse38 .cse40) (or .cse41 (let ((.cse149 (and (forall ((v_ArrVal_836 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse150 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse152 (select .cse150 ~client~0.base))) (let ((.cse151 (select .cse152 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (not (= (select (select .cse150 c_~manager~0.base) .cse64) .cse151)) (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (= (select .cse152 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) .cse151) (<= (+ ~client_back~0 1) v_~client_front~0_112)))))))))) (forall ((v_ArrVal_836 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse153 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse155 (select .cse153 ~client~0.base))) (let ((.cse154 (select .cse155 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (not (= (select (select .cse153 c_~manager~0.base) .cse64) .cse154)) (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (not (= (select .cse155 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) .cse154)) (<= (+ ~client_back~0 1) v_~client_front~0_112)))))))) (< ~client_back~0 0)))))) (and (or .cse0 .cse73 (and (forall ((v_ArrVal_836 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< v_~client_front~0_112 1) (let ((.cse147 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836) ~client~0.base))) (= (select .cse147 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) (select .cse147 (+ (* ~client_back~0 4) ~client~0.offset)))) (<= (+ ~client_back~0 1) v_~client_front~0_112))))) (forall ((v_ArrVal_836 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< v_~client_front~0_112 1) (not (let ((.cse148 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836) ~client~0.base))) (= (select .cse148 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) (select .cse148 (+ (* ~client_back~0 4) ~client~0.offset))))) (<= (+ ~client_back~0 1) v_~client_front~0_112)))))) .cse1 .cse58) (or .cse13 .cse149 .cse34 .cse6 .cse7 .cse14 .cse11) (or .cse149 .cse34 .cse6 .cse7 .cse14 .cse11 .cse12)))))) (or .cse0 (and (or .cse37 .cse27 (and .cse56 .cse57 (or .cse34 (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (not (let ((.cse156 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse156 c_~manager~0.base) .cse64) (select (select .cse156 ~node~0.base) .cse53))))) .cse47 .cse11)) .cse28 .cse18 .cse58) .cse49 (or .cse37 .cse16 .cse28 .cse35 .cse18 (and (or .cse34 .cse38 (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (let ((.cse157 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse157 c_~manager~0.base) .cse87) (select (select .cse157 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset)))))) .cse40) (or (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int) (~node~0.base Int)) (let ((.cse159 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse158 (select .cse159 c_~manager~0.base))) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (not (= (select .cse158 .cse64) (select (select .cse159 ~node~0.base) .cse53))) (= (select .cse158 .cse87) (select (select .cse159 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset))))))) .cse26 .cse47 .cse11) (or .cse34 .cse41 (and (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse162 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse161 (select .cse162 ~client~0.base))) (let ((.cse160 (select .cse161 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (not (= .cse160 (select .cse161 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)))) (<= (+ ~client_back~0 1) v_~client_front~0_112))) (= (select (select .cse162 c_~manager~0.base) .cse87) .cse160)))))))) (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse165 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse164 (select .cse165 ~client~0.base))) (let ((.cse163 (select .cse164 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (forall ((v_~client_front~0_112 Int)) (or (= .cse163 (select .cse164 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))) (< v_~client_front~0_112 1) (<= (+ ~client_back~0 1) v_~client_front~0_112))) (= (select (select .cse165 c_~manager~0.base) .cse87) .cse163)))))))))))) (or .cse37 .cse22 (and (or .cse34 .cse38 .cse50 .cse40 (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse166 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse166 c_~manager~0.base) .cse87) (select (select .cse166 ~node~0.base) .cse53))))) (or .cse26 .cse47 .cse11 (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse169 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse167 (select .cse169 c_~manager~0.base)) (.cse168 (select (select .cse169 ~node~0.base) .cse53))) (or (not (= (select .cse167 .cse64) .cse168)) (= (select .cse167 .cse87) .cse168))))) .cse50) (or (and (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse171 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< v_~client_front~0_112 1) (not (let ((.cse170 (select .cse171 ~client~0.base))) (= (select .cse170 (+ (* ~client_back~0 4) ~client~0.offset)) (select .cse170 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))))) (<= (+ ~client_back~0 1) v_~client_front~0_112))))) (= (select (select .cse171 c_~manager~0.base) .cse87) (select (select .cse171 ~node~0.base) .cse53))))) (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse173 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (let ((.cse172 (select .cse173 ~client~0.base))) (= (select .cse172 (+ (* ~client_back~0 4) ~client~0.offset)) (select .cse172 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)))) (< v_~client_front~0_112 1) (<= (+ ~client_back~0 1) v_~client_front~0_112))) (< ~client_back~0 0))) (= (select (select .cse173 c_~manager~0.base) .cse87) (select (select .cse173 ~node~0.base) .cse53)))))) .cse34 .cse41)) .cse28 .cse35 .cse18)) .cse1) (or .cse0 (and (or .cse25 .cse37 .cse34 .cse20 .cse21 .cse22 .cse174 .cse28 .cse35 .cse18 .cse23) (or .cse37 .cse27 .cse73 .cse175 .cse174 .cse28 .cse18 .cse58) (or .cse29 .cse30 .cse107 .cse110 .cse176) (or .cse37 .cse34 .cse20 .cse21 .cse16 .cse174 .cse28 .cse35 .cse18 .cse31 .cse23)) .cse1) (= c_~safe~0 1) (or (let ((.cse178 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_165| Int) (v_ArrVal_832 Int) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_165|) 0)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_165| v_ArrVal_832) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164|) 0)))))) (and (or .cse34 .cse38 .cse27 (= .cse177 c_~manager_back~0) .cse178 .cse28 .cse11 .cse40) (or .cse0 (and (or .cse29 .cse30 (and .cse179 .cse180) .cse107 .cse178 .cse110) (or .cse27 (and (or .cse34 .cse47 .cse178 .cse11) (or .cse38 .cse73 .cse178 .cse40)) .cse28 .cse58)) .cse1) (or (= c_~manager_back~0 c_~manager_front~0) .cse26 .cse27 .cse47 .cse65 .cse178 .cse28))) (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (let ((.cse201 (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int))) (let ((.cse239 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836) c_~manager~0.base))) (= (select .cse239 .cse64) (select .cse239 .cse69)))))) (let ((.cse181 (and (or (let ((.cse215 (and (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_834 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse221 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (let ((.cse220 (select .cse221 ~node~0.base))) (= (select .cse220 (+ .cse109 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse220 (+ .cse84 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse222 (select (select .cse221 c_~manager~0.base) .cse64)) (.cse223 (select .cse221 ~client~0.base))) (or (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (= .cse222 (select .cse223 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))) (<= (+ ~client_back~0 1) v_~client_front~0_112))) (not (= .cse222 (select .cse223 (+ (* ~client_back~0 4) ~client~0.offset)))))))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_834 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse225 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (let ((.cse224 (select .cse225 ~node~0.base))) (= (select .cse224 (+ .cse109 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse224 (+ .cse84 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse226 (select (select .cse225 c_~manager~0.base) .cse64)) (.cse227 (select .cse225 ~client~0.base))) (or (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (not (= .cse226 (select .cse227 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)))) (<= (+ ~client_back~0 1) v_~client_front~0_112))) (not (= .cse226 (select .cse227 (+ (* ~client_back~0 4) ~client~0.offset))))))) (< ~client_back~0 0))))))))) (and (or .cse34 .cse215 .cse22 .cse28 .cse18 .cse14) (or .cse34 .cse104 .cse215 .cse16 .cse28 .cse18) (or .cse34 .cse104 .cse27 .cse28 .cse18 (forall ((v_ArrVal_834 (Array Int Int)) (v_~client_front~0_112 Int) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int)) (let ((.cse218 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse217 (select .cse218 c_~manager~0.base))) (let ((.cse216 (select .cse217 .cse64))) (or (= .cse216 (select .cse217 .cse69)) (< c_~client_size~0 (+ v_~client_front~0_112 1)) (< v_~client_front~0_112 1) (not (= .cse216 (select (select .cse218 ~client~0.base) (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)))))))))) (or .cse29 .cse30 (forall ((v_ArrVal_834 (Array Int Int)) (v_~client_front~0_112 Int) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int)) (or (< c_~client_size~0 (+ v_~client_front~0_112 1)) (< v_~client_front~0_112 1) (not (let ((.cse219 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse219 c_~manager~0.base) .cse64) (select (select .cse219 ~client~0.base) (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))))))) .cse107 .cse110 .cse14))) .cse41 .cse10 .cse11) (or .cse38 (let ((.cse228 (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int) (~node~0.base Int)) (let ((.cse230 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (<= c_~client_size~0 ~client_back~0) (let ((.cse229 (select .cse230 ~node~0.base))) (= (select .cse229 (+ .cse109 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse229 (+ .cse84 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< ~client_back~0 0) (not (= (select (select .cse230 c_~manager~0.base) .cse64) (select (select .cse230 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset))))))))) (and (or .cse34 .cse201 .cse104 .cse27 .cse28 .cse18) .cse115 (or .cse34 .cse104 .cse16 .cse28 .cse18 .cse228) (or .cse34 .cse22 .cse28 .cse18 .cse14 .cse228))) .cse10 .cse11 .cse40) (or .cse47 .cse65 .cse10 (let ((.cse232 (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int) (~node~0.base Int)) (let ((.cse236 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse235 (select .cse236 c_~manager~0.base))) (let ((.cse237 (select .cse236 ~node~0.base)) (.cse238 (select .cse235 .cse64))) (or (<= c_~client_size~0 ~client_back~0) (not (= (select .cse235 .cse71) (select (select .cse236 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset)))) (< ~client_back~0 0) (not (= (select .cse237 (+ .cse84 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse238)) (= (select .cse237 (+ .cse109 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse238)))))))) (and (or .cse29 .cse30 (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse231 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse231 ~node~0.base) (+ .cse109 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select .cse231 c_~manager~0.base) .cse64)))) .cse107 .cse110 .cse14) (or .cse104 .cse26 .cse16 .cse28 .cse18 .cse232) (or .cse104 (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse234 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse233 (select .cse234 c_~manager~0.base))) (or (= (select .cse233 .cse71) (select .cse233 .cse69)) (not (= (select (select .cse234 ~node~0.base) (+ .cse84 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse233 .cse64))))))) .cse26 .cse27 .cse28 .cse18) (or .cse26 .cse22 .cse28 .cse18 .cse14 .cse232))))))) (and (or .cse6 .cse181 .cse7 .cse12) (or .cse0 (and (or .cse37 .cse16 .cse28 .cse35 .cse18 (and (or .cse34 .cse41 (and (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse182 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse184 (select .cse182 ~client~0.base))) (let ((.cse183 (select .cse184 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (= (select (select .cse182 c_~manager~0.base) .cse87) .cse183) (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (= (select .cse184 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) .cse183) (<= (+ ~client_back~0 1) v_~client_front~0_112)))))))))) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse187 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse185 (select .cse187 ~client~0.base))) (let ((.cse186 (select .cse185 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (not (= (select .cse185 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) .cse186)) (<= (+ ~client_back~0 1) v_~client_front~0_112))) (= (select (select .cse187 c_~manager~0.base) .cse87) .cse186)))))))))) (or .cse34 .cse38 (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (let ((.cse188 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse188 c_~manager~0.base) .cse87) (select (select .cse188 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset)))))) .cse40) (or (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int) (~node~0.base Int)) (let ((.cse189 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse190 (select .cse189 c_~manager~0.base))) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (not (= (select (select .cse189 ~node~0.base) (+ .cse84 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse190 .cse64))) (= (select .cse190 .cse87) (select (select .cse189 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset))))))) .cse26 .cse47 .cse11))) (or .cse37 .cse27 (and .cse56 (or (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (not (let ((.cse191 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse191 ~node~0.base) (+ .cse84 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select .cse191 c_~manager~0.base) .cse64))))) .cse34 .cse47 .cse11) .cse57) .cse28 .cse18 .cse58) .cse49 (or .cse37 .cse22 .cse28 .cse35 .cse18 (and (or .cse34 .cse41 (and (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_834 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse193 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< v_~client_front~0_112 1) (not (let ((.cse192 (select .cse193 ~client~0.base))) (= (select .cse192 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) (select .cse192 (+ (* ~client_back~0 4) ~client~0.offset))))) (<= (+ ~client_back~0 1) v_~client_front~0_112))))) (= (select (select .cse193 c_~manager~0.base) .cse87) (select (select .cse193 ~node~0.base) (+ .cse84 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_834 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse195 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< v_~client_front~0_112 1) (let ((.cse194 (select .cse195 ~client~0.base))) (= (select .cse194 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) (select .cse194 (+ (* ~client_back~0 4) ~client~0.offset)))) (<= (+ ~client_back~0 1) v_~client_front~0_112))))) (= (select (select .cse195 c_~manager~0.base) .cse87) (select (select .cse195 ~node~0.base) (+ .cse84 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (or .cse34 .cse38 (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse196 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse196 c_~manager~0.base) .cse87) (select (select .cse196 ~node~0.base) (+ .cse84 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) .cse50 .cse40) (or .cse26 (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse199 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse198 (select (select .cse199 ~node~0.base) (+ .cse84 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse197 (select .cse199 c_~manager~0.base))) (or (= (select .cse197 .cse87) .cse198) (not (= .cse198 (select .cse197 .cse64))))))) .cse47 .cse11 .cse50)))) .cse1) (or (and (or .cse47 (let ((.cse200 (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int)) (let ((.cse203 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse202 (select .cse203 c_~manager~0.base))) (or (<= c_~client_size~0 ~client_back~0) (= (select .cse202 .cse64) (select .cse202 .cse69)) (not (= (select .cse202 .cse71) (select (select .cse203 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset)))) (< ~client_back~0 0))))))) (and (or .cse6 .cse200 .cse7 .cse26 .cse65 .cse14 .cse12) (or .cse13 .cse6 .cse200 .cse7 .cse26 .cse65 .cse14) (or .cse0 .cse34 .cse201 .cse1 .cse50))) .cse11) (or .cse41 (let ((.cse204 (and (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse207 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse209 (select .cse207 ~client~0.base))) (let ((.cse208 (select .cse209 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (not (= (select (select .cse207 c_~manager~0.base) .cse64) .cse208)) (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (= (select .cse209 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) .cse208) (<= (+ ~client_back~0 1) v_~client_front~0_112)))))))) (< ~client_back~0 0))) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse212 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse210 (select .cse212 ~client~0.base))) (let ((.cse211 (select .cse210 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (not (= (select .cse210 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) .cse211)) (<= (+ ~client_back~0 1) v_~client_front~0_112))) (not (= (select (select .cse212 c_~manager~0.base) .cse64) .cse211)))))))))))) (and (or .cse34 .cse6 .cse7 .cse204 .cse14 .cse11 .cse12) (or .cse0 .cse73 .cse1 .cse58 (and (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< v_~client_front~0_112 1) (let ((.cse205 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836) ~client~0.base))) (= (select .cse205 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) (select .cse205 (+ (* ~client_back~0 4) ~client~0.offset)))) (<= (+ ~client_back~0 1) v_~client_front~0_112))))) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< v_~client_front~0_112 1) (not (let ((.cse206 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836) ~client~0.base))) (= (select .cse206 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) (select .cse206 (+ (* ~client_back~0 4) ~client~0.offset))))) (<= (+ ~client_back~0 1) v_~client_front~0_112))))))) (or .cse13 .cse34 .cse6 .cse7 .cse204 .cse14 .cse11)))) (or .cse38 (let ((.cse213 (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (not (let ((.cse214 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse214 c_~manager~0.base) .cse64) (select (select .cse214 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset))))))))) (and (or .cse34 .cse6 .cse213 .cse7 .cse14 .cse11 .cse12) (or .cse13 .cse34 .cse6 .cse213 .cse7 .cse14 .cse11) .cse62)) .cse40)) .cse28 .cse32) (or .cse13 .cse6 .cse181 .cse7)))) .cse240) (or .cse20 .cse21 .cse28 (let ((.cse241 (= .cse242 c_~update~0))) (and (or .cse34 .cse6 .cse7 .cse8 .cse241 .cse14 .cse11 .cse12) (or .cse13 .cse34 .cse6 .cse7 .cse8 .cse241 .cse14 .cse11) (or .cse0 .cse73 .cse241 .cse1 .cse58))) .cse32 .cse23) (or .cse13 .cse6 .cse7 .cse36) (or .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse243) (or .cse28 (and (or .cse47 .cse11 (let ((.cse244 (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int)) (let ((.cse247 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse246 (select .cse247 c_~manager~0.base))) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (not (= (select .cse246 .cse71) (select (select .cse247 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset)))) (= (select .cse246 .cse64) (select .cse246 .cse69)))))))) (and (or .cse6 .cse7 .cse244 .cse26 .cse65 .cse14 .cse12) (or .cse0 .cse34 .cse245 .cse1 .cse50) (or .cse13 .cse6 .cse7 .cse244 .cse26 .cse65 .cse14)))) (or .cse41 (let ((.cse248 (and (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse253 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse252 (select .cse253 ~client~0.base))) (let ((.cse251 (select .cse252 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (forall ((v_~client_front~0_112 Int)) (or (= .cse251 (select .cse252 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))) (< v_~client_front~0_112 1) (<= (+ ~client_back~0 1) v_~client_front~0_112))) (not (= (select (select .cse253 c_~manager~0.base) .cse64) .cse251))))))))) (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse256 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse255 (select .cse256 ~client~0.base))) (let ((.cse254 (select .cse255 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (not (= .cse254 (select .cse255 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)))) (<= (+ ~client_back~0 1) v_~client_front~0_112))) (not (= (select (select .cse256 c_~manager~0.base) .cse64) .cse254))))))) (< ~client_back~0 0)))))) (and (or .cse13 .cse34 .cse6 .cse7 .cse248 .cse14 .cse11) (or .cse0 .cse73 .cse1 .cse58 (and (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (let ((.cse249 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836) ~client~0.base))) (= (select .cse249 (+ (* ~client_back~0 4) ~client~0.offset)) (select .cse249 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)))) (< v_~client_front~0_112 1) (<= (+ ~client_back~0 1) v_~client_front~0_112))) (< ~client_back~0 0))) (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< v_~client_front~0_112 1) (not (let ((.cse250 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836) ~client~0.base))) (= (select .cse250 (+ (* ~client_back~0 4) ~client~0.offset)) (select .cse250 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))))) (<= (+ ~client_back~0 1) v_~client_front~0_112))))))) (or .cse34 .cse6 .cse7 .cse248 .cse14 .cse11 .cse12)))) (or (let ((.cse257 (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (not (let ((.cse258 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse258 c_~manager~0.base) .cse64) (select (select .cse258 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset))))))))) (and (or .cse34 .cse6 .cse7 .cse257 .cse14 .cse11 .cse12) (or .cse13 .cse34 .cse6 .cse7 .cse257 .cse14 .cse11) .cse62)) .cse38 .cse40)) .cse32) .cse4 .cse5 (or .cse13 .cse6 .cse7 .cse8 .cse10 .cse11 .cse243) (or .cse0 (and (or .cse37 .cse22 (and (or .cse34 .cse41 (and (forall ((v_ArrVal_836 (Array Int Int)) (~node~0.base Int)) (let ((.cse260 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< v_~client_front~0_112 1) (not (let ((.cse259 (select .cse260 ~client~0.base))) (= (select .cse259 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) (select .cse259 (+ (* ~client_back~0 4) ~client~0.offset))))) (<= (+ ~client_back~0 1) v_~client_front~0_112))))) (= (select (select .cse260 c_~manager~0.base) .cse87) (select (select .cse260 ~node~0.base) .cse53))))) (forall ((v_ArrVal_836 (Array Int Int)) (~node~0.base Int)) (let ((.cse262 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< v_~client_front~0_112 1) (let ((.cse261 (select .cse262 ~client~0.base))) (= (select .cse261 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) (select .cse261 (+ (* ~client_back~0 4) ~client~0.offset)))) (<= (+ ~client_back~0 1) v_~client_front~0_112))))) (= (select (select .cse262 c_~manager~0.base) .cse87) (select (select .cse262 ~node~0.base) .cse53))))))) (or .cse34 .cse38 (forall ((v_ArrVal_836 (Array Int Int)) (~node~0.base Int)) (let ((.cse263 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse263 c_~manager~0.base) .cse87) (select (select .cse263 ~node~0.base) .cse53)))) .cse50 .cse40) (or .cse26 (forall ((v_ArrVal_836 (Array Int Int)) (~node~0.base Int)) (let ((.cse266 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse265 (select .cse266 c_~manager~0.base)) (.cse264 (select (select .cse266 ~node~0.base) .cse53))) (or (not (= .cse264 (select .cse265 .cse64))) (= (select .cse265 .cse87) .cse264))))) .cse47 .cse11 .cse50)) .cse28 .cse35 .cse18) (or .cse37 .cse27 .cse28 .cse18 (and .cse56 .cse57 (or .cse34 .cse47 (forall ((v_ArrVal_836 (Array Int Int)) (~node~0.base Int)) (not (let ((.cse267 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse267 ~node~0.base) .cse53) (select (select .cse267 c_~manager~0.base) .cse64))))) .cse11)) .cse58) .cse49 (or .cse37 .cse16 .cse28 .cse35 .cse18 (and (or .cse34 .cse38 (forall ((v_ArrVal_836 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (let ((.cse268 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse268 c_~manager~0.base) .cse87) (select (select .cse268 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset)))))) .cse40) (or .cse34 (and (forall ((v_ArrVal_836 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse271 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse269 (select .cse271 ~client~0.base))) (let ((.cse270 (select .cse269 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (not (= (select .cse269 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) .cse270)) (<= (+ ~client_back~0 1) v_~client_front~0_112))) (= (select (select .cse271 c_~manager~0.base) .cse87) .cse270)))))) (< ~client_back~0 0))) (forall ((v_ArrVal_836 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse272 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse274 (select .cse272 ~client~0.base))) (let ((.cse273 (select .cse274 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (= (select (select .cse272 c_~manager~0.base) .cse87) .cse273) (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (= (select .cse274 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) .cse273) (<= (+ ~client_back~0 1) v_~client_front~0_112))))))))))) .cse41) (or (forall ((v_ArrVal_836 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int) (~node~0.base Int)) (let ((.cse275 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse276 (select .cse275 c_~manager~0.base))) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (not (= (select (select .cse275 ~node~0.base) .cse53) (select .cse276 .cse64))) (= (select .cse276 .cse87) (select (select .cse275 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset))))))) .cse26 .cse47 .cse11)))) .cse1) (or .cse240 (let ((.cse278 (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| Int)) (or (let ((.cse307 (select (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836) c_~manager~0.base))) (= (select .cse307 .cse69) (select .cse307 .cse64))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164|) 0)))))) (let ((.cse277 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164|) 0)))) (.cse301 (and (or .cse34 (forall ((v_~client_front~0_112 Int) (v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| Int)) (let ((.cse302 (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse304 (select .cse302 c_~manager~0.base))) (let ((.cse303 (select .cse304 .cse64))) (or (not (= (select (select .cse302 ~client~0.base) (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) .cse303)) (< c_~client_size~0 (+ v_~client_front~0_112 1)) (< v_~client_front~0_112 1) (= (select .cse304 .cse69) .cse303) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164|) 0))))))) .cse41 .cse27 .cse28 .cse11) (or .cse26 .cse27 .cse47 .cse65 (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (v_~node_back~0_131 Int) (~node~0.base Int) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| Int)) (let ((.cse306 (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse305 (select .cse306 c_~manager~0.base))) (or (not (= (select .cse305 .cse64) (select (select .cse306 ~node~0.base) (+ (* 4 v_~node_back~0_131) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< v_~node_back~0_131 0) (< 0 v_~node_back~0_131) (= (select .cse305 .cse69) (select .cse305 .cse71)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164|) 0)))))) .cse28) (or .cse34 .cse278 .cse38 .cse27 .cse28 .cse11 .cse40)))) (and (or (and (or .cse0 .cse277 .cse38 .cse73 .cse1 .cse58 .cse50 .cse40) (or .cse0 .cse34 .cse278 .cse47 .cse11 .cse1 .cse50) (or .cse0 .cse41 .cse73 .cse1 .cse58 (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164|) 0)) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< v_~client_front~0_112 1) (<= (+ ~client_back~0 1) v_~client_front~0_112) (not (let ((.cse279 (select (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836) ~client~0.base))) (= (select .cse279 (+ (* ~client_back~0 4) ~client~0.offset)) (select .cse279 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))))))) (< ~client_back~0 0))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164|) 0)) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< v_~client_front~0_112 1) (<= (+ ~client_back~0 1) v_~client_front~0_112) (let ((.cse280 (select (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836) ~client~0.base))) (= (select .cse280 (+ (* ~client_back~0 4) ~client~0.offset)) (select .cse280 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))))))))))))) .cse28 .cse32) (or .cse0 .cse1 (and (or .cse22 (and (or (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (v_~node_back~0_131 Int) (~node~0.base Int) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| Int)) (let ((.cse283 (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse282 (select (select .cse283 ~node~0.base) (+ (* 4 v_~node_back~0_131) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse281 (select .cse283 c_~manager~0.base))) (or (not (= (select .cse281 .cse64) .cse282)) (< v_~node_back~0_131 0) (= .cse282 (select .cse281 .cse87)) (< 0 v_~node_back~0_131) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164|) 0)))))) .cse26 .cse47 .cse11 .cse50) (or .cse34 .cse41 (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164|) 0)) (forall ((v_~node_back~0_131 Int)) (or (< v_~node_back~0_131 0) (< 0 v_~node_back~0_131) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse284 (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (= (select (select .cse284 ~node~0.base) (+ (* 4 v_~node_back~0_131) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select .cse284 c_~manager~0.base) .cse87)) (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< v_~client_front~0_112 1) (<= (+ ~client_back~0 1) v_~client_front~0_112) (not (let ((.cse285 (select .cse284 ~client~0.base))) (= (select .cse285 (+ (* ~client_back~0 4) ~client~0.offset)) (select .cse285 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))))))) (< ~client_back~0 0)))))))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164|) 0)) (forall ((v_~node_back~0_131 Int)) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse287 (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< v_~client_front~0_112 1) (<= (+ ~client_back~0 1) v_~client_front~0_112) (let ((.cse286 (select .cse287 ~client~0.base))) (= (select .cse286 (+ (* ~client_back~0 4) ~client~0.offset)) (select .cse286 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)))))))) (= (select (select .cse287 ~node~0.base) (+ (* 4 v_~node_back~0_131) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select .cse287 c_~manager~0.base) .cse87))))) (< v_~node_back~0_131 0) (< 0 v_~node_back~0_131))))))) (or .cse34 .cse38 (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (v_~node_back~0_131 Int) (~node~0.base Int) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| Int)) (or (< v_~node_back~0_131 0) (let ((.cse288 (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse288 ~node~0.base) (+ (* 4 v_~node_back~0_131) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select .cse288 c_~manager~0.base) .cse87))) (< 0 v_~node_back~0_131) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164|) 0)))) .cse50 .cse40)) .cse28 .cse35) (or .cse16 .cse28 .cse35 (and (or .cse34 .cse41 (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| Int)) (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse291 (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse290 (select .cse291 ~client~0.base))) (let ((.cse289 (select .cse290 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (<= (+ ~client_back~0 1) v_~client_front~0_112) (= .cse289 (select .cse290 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))))) (= .cse289 (select (select .cse291 c_~manager~0.base) .cse87))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164|) 0)))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| Int)) (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse293 (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse294 (select .cse293 ~client~0.base))) (let ((.cse292 (select .cse294 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (= .cse292 (select (select .cse293 c_~manager~0.base) .cse87)) (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (<= (+ ~client_back~0 1) v_~client_front~0_112) (not (= .cse292 (select .cse294 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))))))))))) (< ~client_back~0 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164|) 0)))))) (or .cse34 .cse38 (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (let ((.cse295 (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse295 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset)) (select (select .cse295 c_~manager~0.base) .cse87))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164|) 0)))) .cse40) (or (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (v_~node_back~0_131 Int) (~client~0.offset Int) (~client_back~0 Int) (~node~0.base Int) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| Int)) (let ((.cse297 (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse296 (select .cse297 c_~manager~0.base))) (or (<= c_~client_size~0 ~client_back~0) (not (= (select .cse296 .cse64) (select (select .cse297 ~node~0.base) (+ (* 4 v_~node_back~0_131) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< ~client_back~0 0) (< v_~node_back~0_131 0) (< 0 v_~node_back~0_131) (= (select (select .cse297 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset)) (select .cse296 .cse87)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164|) 0)))))) .cse26 .cse47 .cse11))) (or .cse277 .cse29 .cse30 .cse107 .cse298 .cse110) (or (and (or .cse277 .cse299 .cse41 .cse73) (or .cse277 .cse38 .cse73 .cse40) (or .cse34 .cse47 (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (v_~node_back~0_131 Int) (~node~0.base Int) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| Int)) (or (not (let ((.cse300 (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse300 c_~manager~0.base) .cse64) (select (select .cse300 ~node~0.base) (+ (* 4 v_~node_back~0_131) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (< v_~node_back~0_131 0) (< 0 v_~node_back~0_131) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164|) 0)))) .cse11)) .cse27 .cse28 .cse58))) (or .cse301 .cse12) (or .cse13 .cse301)))))))))))) is different from false [2023-01-27 21:21:15,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:21:17,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:21:58,033 WARN L222 SmtUtils]: Spent 34.95s on a formula simplification. DAG size of input: 235 DAG size of output: 229 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:22:00,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:22:02,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:22:05,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:22:30,459 WARN L222 SmtUtils]: Spent 12.92s on a formula simplification that was a NOOP. DAG size: 294 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:22:33,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:22:35,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:22:35,935 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse379 (* 4 c_~manager_front~0))) (let ((.cse380 (* c_~manager_back~0 4)) (.cse110 (* c_~node_front~0 4)) (.cse85 (* c_~node_back~0 4)) (.cse378 (select |c_#memory_int| c_~manager~0.base)) (.cse88 (+ .cse379 c_~manager~0.offset)) (.cse39 (= c_~client_state~0 0))) (let ((.cse48 (not .cse39)) (.cse10 (< c_~manager_back~0 0)) (.cse11 (<= c_~manager_size~0 c_~manager_back~0)) (.cse41 (= c_~client_state~0 1)) (.cse374 (+ c_~manager_back~0 1)) (.cse45 (select .cse378 .cse88)) (.cse19 (= c_~manager_state~0 0)) (.cse108 (= 2 c_~manager_state~0)) (.cse111 (= 3 c_~manager_state~0)) (.cse54 (+ .cse85 c_~node~0.offset)) (.cse18 (= c_~manager_state~0 1)) (.cse377 (select |c_#memory_int| c_~node~0.base)) (.cse321 (+ .cse110 c_~node~0.offset)) (.cse65 (+ c_~manager~0.offset .cse380)) (.cse72 (+ c_~manager~0.offset .cse380 4)) (.cse70 (+ .cse379 c_~manager~0.offset 4))) (let ((.cse244 (select .cse378 .cse70)) (.cse14 (<= c_~node_back~0 c_~node_front~0)) (.cse363 (select .cse378 .cse72)) (.cse53 (select .cse378 .cse65)) (.cse179 (+ c_~manager_front~0 1)) (.cse25 (<= c_~manager_back~0 c_~manager_front~0)) (.cse27 (<= c_~manager_size~0 c_~manager_front~0)) (.cse178 (not (= (mod (* c_~safe~0 255) 256) 0))) (.cse311 (= c_~update~0 (select .cse377 .cse321))) (.cse38 (not .cse18)) (.cse36 (not (= (select .cse377 .cse54) c_~update~0))) (.cse37 (<= c_~node_size~0 c_~node_back~0)) (.cse310 (or .cse18 .cse19 .cse108 .cse111)) (.cse22 (not (= (select (select |c_#memory_int| c_~client~0.base) (+ (* c_~client_back~0 4) c_~client~0.offset)) c_~ok~0))) (.cse23 (< c_~client_back~0 0)) (.cse29 (not .cse111)) (.cse30 (<= c_~client_size~0 c_~client_back~0)) (.cse32 (= c_~ok~0 .cse45)) (.cse33 (not .cse108)) (.cse24 (= c_~update~0 .cse45)) (.cse28 (<= .cse374 c_~manager_front~0)) (.cse35 (not .cse19)) (.cse26 (< c_~manager_front~0 0)) (.cse301 (< c_~client_size~0 2)) (.cse42 (not .cse41)) (.cse181 (or .cse39 .cse41)) (.cse182 (or .cse48 .cse10 .cse11))) (let ((.cse300 (and (or .cse301 .cse42) .cse181 .cse182)) (.cse17 (or .cse24 .cse28 .cse35 .cse26)) (.cse20 (or .cse28 .cse26 .cse32 .cse33)) (.cse15 (or .cse311 (and (or .cse38 .cse36 .cse37) .cse310 (or .cse22 .cse23 .cse29 .cse30)))) (.cse34 (< c_~node_back~0 0)) (.cse21 (or .cse108 .cse111 .cse178)) (.cse16 (or .cse25 .cse26 .cse27 .cse32 .cse33)) (.cse0 (= c_~node_state~0 1)) (.cse74 (<= c_~manager_back~0 .cse179)) (.cse1 (= c_~node_state~0 0)) (.cse59 (<= c_~manager_size~0 .cse179)) (.cse51 (< c_~client_size~0 1)) (.cse144 (forall ((v_ArrVal_836 (Array Int Int))) (let ((.cse376 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836) c_~manager~0.base))) (= (select .cse376 .cse70) (select .cse376 .cse65))))) (.cse247 (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int))) (let ((.cse375 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836) c_~manager~0.base))) (= (select .cse375 .cse65) (select .cse375 .cse70))))) (.cse66 (<= c_~manager_size~0 .cse374)) (.cse49 (forall ((~node~0.base Int)) (not (= .cse53 (select (select |c_#memory_int| ~node~0.base) .cse54))))) (.cse142 (forall ((~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (not (= .cse363 (select (select |c_#memory_int| ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset))))))) (.cse116 (or .cse18 .cse19 .cse108 .cse111 .cse14)) (.cse141 (= .cse244 .cse53)) (.cse135 (forall ((~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (not (= .cse53 (select (select |c_#memory_int| ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset)))) (< ~client_back~0 0)))) (.cse177 (= .cse244 c_~ok~0)) (.cse176 (forall ((~node~0.base Int)) (not (= c_~update~0 (select (select |c_#memory_int| ~node~0.base) .cse54))))) (.cse105 (<= (+ c_~node_back~0 1) c_~node_front~0))) (let ((.cse2 (or .cse22 .cse23 .cse29 .cse178 .cse30)) (.cse3 (or .cse24 .cse25 .cse35 .cse26 .cse27)) (.cse9 (let ((.cse372 (forall ((~node~0.base Int)) (let ((.cse373 (select |c_#memory_int| ~node~0.base))) (or (= c_~update~0 (select .cse373 .cse321)) (not (= c_~update~0 (select .cse373 .cse54)))))))) (and (or .cse18 .cse19 (forall ((~node~0.base Int)) (= c_~update~0 (select (select |c_#memory_int| ~node~0.base) .cse321))) .cse108 .cse111 .cse14) (or .cse25 .cse22 .cse23 .cse29 .cse372 .cse26 .cse37 .cse14 .cse30) (or .cse25 .cse105 .cse35 .cse177 .cse176 .cse26 .cse37) (or .cse25 .cse22 .cse105 .cse23 .cse38 .cse372 .cse26 .cse37 .cse30)))) (.cse60 (let ((.cse367 (forall ((~node~0.base Int)) (let ((.cse371 (select |c_#memory_int| ~node~0.base))) (= (select .cse371 .cse54) (select .cse371 .cse321)))))) (and (or .cse48 .cse66 (let ((.cse364 (forall ((~node~0.base Int)) (let ((.cse365 (select |c_#memory_int| ~node~0.base))) (or (not (= .cse53 (select .cse365 .cse54))) (= .cse53 (select .cse365 .cse321))))))) (and (or .cse18 .cse19 .cse108 .cse111 .cse14 (forall ((~node~0.base Int)) (= .cse53 (select (select |c_#memory_int| ~node~0.base) .cse321)))) (or .cse105 .cse28 .cse35 (= .cse363 .cse244) .cse26 .cse37 .cse49) (or .cse364 .cse142 .cse28 .cse29 .cse26 .cse37 .cse14) (or .cse364 .cse105 .cse142 .cse28 .cse38 .cse26 .cse37))) .cse10) (or .cse42 .cse10 .cse11 (let ((.cse366 (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< c_~client_size~0 (+ v_~client_front~0_112 1)) (< v_~client_front~0_112 1) (not (= .cse53 (select (select |c_#memory_int| ~client~0.base) (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))))))) (.cse368 (and (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse369 (select |c_#memory_int| ~client~0.base))) (or (not (= .cse53 (select .cse369 (+ (* ~client_back~0 4) ~client~0.offset)))) (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (not (= .cse53 (select .cse369 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)))) (<= (+ ~client_back~0 1) v_~client_front~0_112)))))) (< ~client_back~0 0))) (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse370 (select |c_#memory_int| ~client~0.base))) (or (not (= .cse53 (select .cse370 (+ (* ~client_back~0 4) ~client~0.offset)))) (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (= .cse53 (select .cse370 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))) (<= (+ ~client_back~0 1) v_~client_front~0_112)))))) (< ~client_back~0 0)))))) (and (or .cse18 .cse19 .cse108 .cse111 .cse14 .cse366) (or .cse141 .cse25 .cse105 .cse35 .cse26 .cse37 .cse366) (or .cse25 .cse105 .cse38 .cse26 .cse37 .cse367 .cse368) (or .cse25 .cse29 .cse26 .cse37 .cse14 .cse367 .cse368)))) (or (and .cse116 (or .cse141 .cse25 .cse105 .cse35 .cse26 .cse37) (or .cse25 .cse29 .cse26 .cse37 .cse14 .cse135 .cse367) (or .cse25 .cse105 .cse38 .cse26 .cse37 .cse135 .cse367)) .cse39 .cse10 .cse11 .cse41)))) (.cse61 (and (or .cse39 (let ((.cse339 (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int) (~node~0.base Int)) (let ((.cse341 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (let ((.cse340 (select .cse341 ~node~0.base))) (= (select .cse340 .cse321) (select .cse340 .cse54))) (not (= (select (select .cse341 c_~manager~0.base) .cse65) (select (select .cse341 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset))))))))) (and .cse116 (or .cse25 .cse105 .cse35 .cse247 .cse26 .cse37) (or .cse25 .cse29 .cse26 .cse37 .cse14 .cse339) (or .cse25 .cse105 .cse38 .cse26 .cse37 .cse339))) .cse10 .cse11 .cse41) (or .cse48 .cse66 .cse10 (let ((.cse342 (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int) (~node~0.base Int)) (let ((.cse349 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse348 (select .cse349 c_~manager~0.base))) (let ((.cse346 (select .cse348 .cse65)) (.cse347 (select .cse349 ~node~0.base))) (or (= .cse346 (select .cse347 .cse321)) (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (not (= .cse346 (select .cse347 .cse54))) (not (= (select .cse348 .cse72) (select (select .cse349 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset))))))))))) (and (or .cse105 .cse342 .cse28 .cse38 .cse26 .cse37) (or .cse342 .cse28 .cse29 .cse26 .cse37 .cse14) (or .cse18 .cse19 (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse343 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse343 c_~manager~0.base) .cse65) (select (select .cse343 ~node~0.base) .cse321)))) .cse108 .cse111 .cse14) (or .cse105 .cse28 .cse35 .cse26 .cse37 (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse345 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse344 (select .cse345 c_~manager~0.base))) (or (not (= (select .cse344 .cse65) (select (select .cse345 ~node~0.base) .cse54))) (= (select .cse344 .cse72) (select .cse344 .cse70)))))))))) (or .cse42 .cse10 .cse11 (let ((.cse350 (and (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse357 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse355 (select (select .cse357 c_~manager~0.base) .cse65)) (.cse356 (select .cse357 ~client~0.base))) (or (forall ((v_~client_front~0_112 Int)) (or (= .cse355 (select .cse356 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))) (< v_~client_front~0_112 1) (<= (+ ~client_back~0 1) v_~client_front~0_112))) (not (= .cse355 (select .cse356 (+ (* ~client_back~0 4) ~client~0.offset))))))))) (let ((.cse358 (select .cse357 ~node~0.base))) (= (select .cse358 .cse321) (select .cse358 .cse54)))))) (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse361 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse359 (select (select .cse361 c_~manager~0.base) .cse65)) (.cse360 (select .cse361 ~client~0.base))) (or (forall ((v_~client_front~0_112 Int)) (or (not (= .cse359 (select .cse360 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)))) (< v_~client_front~0_112 1) (<= (+ ~client_back~0 1) v_~client_front~0_112))) (not (= .cse359 (select .cse360 (+ (* ~client_back~0 4) ~client~0.offset))))))))) (let ((.cse362 (select .cse361 ~node~0.base))) (= (select .cse362 .cse321) (select .cse362 .cse54))))))))) (and (or .cse25 .cse105 .cse350 .cse38 .cse26 .cse37) (or .cse25 .cse350 .cse29 .cse26 .cse37 .cse14) (or (forall ((v_~client_front~0_112 Int) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int)) (let ((.cse352 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse353 (select .cse352 c_~manager~0.base))) (let ((.cse351 (select .cse353 .cse65))) (or (< c_~client_size~0 (+ v_~client_front~0_112 1)) (not (= .cse351 (select (select .cse352 ~client~0.base) (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)))) (< v_~client_front~0_112 1) (= .cse351 (select .cse353 .cse70))))))) .cse25 .cse105 .cse35 .cse26 .cse37) (or .cse18 .cse19 (forall ((v_~client_front~0_112 Int) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int)) (or (< c_~client_size~0 (+ v_~client_front~0_112 1)) (not (let ((.cse354 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse354 c_~manager~0.base) .cse65) (select (select .cse354 ~client~0.base) (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))))) (< v_~client_front~0_112 1))) .cse108 .cse111 .cse14)))))) (.cse56 (and (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< v_~client_front~0_112 1) (not (let ((.cse337 (select |c_#memory_int| ~client~0.base))) (= (select .cse337 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) (select .cse337 (+ (* ~client_back~0 4) ~client~0.offset))))) (<= (+ ~client_back~0 1) v_~client_front~0_112))) (< ~client_back~0 0))) (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< v_~client_front~0_112 1) (let ((.cse338 (select |c_#memory_int| ~client~0.base))) (= (select .cse338 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) (select .cse338 (+ (* ~client_back~0 4) ~client~0.offset)))) (<= (+ ~client_back~0 1) v_~client_front~0_112))) (< ~client_back~0 0))))) (.cse31 (and (or .cse42 (let ((.cse312 (and (forall ((v_ArrVal_836 (Array Int Int)) (~node~0.base Int)) (let ((.cse319 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse318 (select .cse319 ~client~0.base)) (.cse317 (select (select .cse319 c_~manager~0.base) .cse65))) (or (not (= .cse317 (select .cse318 (+ (* ~client_back~0 4) ~client~0.offset)))) (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (= (select .cse318 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) .cse317) (<= (+ ~client_back~0 1) v_~client_front~0_112)))))) (< ~client_back~0 0))) (let ((.cse320 (select .cse319 ~node~0.base))) (= (select .cse320 .cse54) (select .cse320 .cse321)))))) (forall ((v_ArrVal_836 (Array Int Int)) (~node~0.base Int)) (let ((.cse324 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse323 (select .cse324 ~client~0.base)) (.cse322 (select (select .cse324 c_~manager~0.base) .cse65))) (or (not (= .cse322 (select .cse323 (+ (* ~client_back~0 4) ~client~0.offset)))) (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (not (= (select .cse323 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) .cse322)) (<= (+ ~client_back~0 1) v_~client_front~0_112)))))) (< ~client_back~0 0))) (let ((.cse325 (select .cse324 ~node~0.base))) (= (select .cse325 .cse54) (select .cse325 .cse321))))))))) (and (or .cse25 .cse29 .cse26 .cse37 .cse14 .cse312) (or .cse25 .cse105 .cse38 .cse26 .cse37 .cse312) (or .cse25 .cse105 .cse35 (forall ((v_~client_front~0_112 Int) (v_ArrVal_836 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int)) (let ((.cse313 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse315 (select .cse313 c_~manager~0.base))) (let ((.cse314 (select .cse315 .cse65))) (or (< c_~client_size~0 (+ v_~client_front~0_112 1)) (< v_~client_front~0_112 1) (not (= (select (select .cse313 ~client~0.base) (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) .cse314)) (= (select .cse315 .cse70) .cse314)))))) .cse26 .cse37) (or .cse18 .cse19 .cse108 (forall ((v_~client_front~0_112 Int) (v_ArrVal_836 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int)) (or (< c_~client_size~0 (+ v_~client_front~0_112 1)) (< v_~client_front~0_112 1) (not (let ((.cse316 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse316 ~client~0.base) (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) (select (select .cse316 c_~manager~0.base) .cse65)))))) .cse111 .cse14))) .cse10 .cse11) (or .cse39 (let ((.cse326 (forall ((v_ArrVal_836 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int) (~node~0.base Int)) (let ((.cse327 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (<= c_~client_size~0 ~client_back~0) (not (= (select (select .cse327 c_~manager~0.base) .cse65) (select (select .cse327 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset)))) (< ~client_back~0 0) (let ((.cse328 (select .cse327 ~node~0.base))) (= (select .cse328 .cse54) (select .cse328 .cse321)))))))) (and (or .cse25 .cse105 .cse38 .cse326 .cse26 .cse37) .cse116 (or .cse25 .cse29 .cse326 .cse26 .cse37 .cse14) (or .cse25 .cse105 .cse35 .cse144 .cse26 .cse37))) .cse10 .cse11 .cse41) (or .cse48 .cse66 (let ((.cse331 (forall ((v_ArrVal_836 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int) (~node~0.base Int)) (let ((.cse335 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse336 (select .cse335 c_~manager~0.base))) (let ((.cse334 (select .cse335 ~node~0.base)) (.cse333 (select .cse336 .cse65))) (or (<= c_~client_size~0 ~client_back~0) (= .cse333 (select .cse334 .cse321)) (< ~client_back~0 0) (not (= (select (select .cse335 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset)) (select .cse336 .cse72))) (not (= (select .cse334 .cse54) .cse333))))))))) (and (or .cse105 .cse28 (forall ((v_ArrVal_836 (Array Int Int)) (~node~0.base Int)) (let ((.cse330 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse329 (select .cse330 c_~manager~0.base))) (or (= (select .cse329 .cse70) (select .cse329 .cse72)) (not (= (select (select .cse330 ~node~0.base) .cse54) (select .cse329 .cse65))))))) .cse35 .cse26 .cse37) (or .cse28 .cse331 .cse29 .cse26 .cse37 .cse14) (or .cse18 .cse19 (forall ((v_ArrVal_836 (Array Int Int)) (~node~0.base Int)) (let ((.cse332 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse332 c_~manager~0.base) .cse65) (select (select .cse332 ~node~0.base) .cse321)))) .cse108 .cse111 .cse14) (or .cse105 .cse28 .cse331 .cse38 .cse26 .cse37))) .cse10))) (.cse63 (or .cse0 .cse74 .cse1 .cse59 .cse51)) (.cse4 (or (and .cse21 .cse16) .cse18 .cse19)) (.cse5 (or .cse34 .cse38 .cse36 .cse37 .cse178)) (.cse134 (and .cse17 .cse20 .cse15)) (.cse6 (< c_~node_front~0 0)) (.cse7 (<= c_~node_size~0 c_~node_front~0)) (.cse8 (not (= .cse53 c_~ok~0))) (.cse245 (and (or (and .cse310 (or .cse25 .cse35 .cse36 .cse26 .cse37) (or .cse25 .cse22 .cse23 .cse26 .cse33 .cse30)) .cse311 .cse14) (or .cse105 .cse28 .cse38 .cse36 .cse26 .cse37 .cse32))) (.cse57 (or .cse39 .cse74 .cse41)) (.cse58 (or .cse301 .cse42 .cse74)) (.cse50 (or .cse18 .cse19 .cse108 .cse300 .cse111)) (.cse242 (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse12 (not .cse0)) (.cse13 (not .cse1))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5)) (or .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse6 .cse7 .cse14 (and .cse3 .cse15 .cse16)) (or .cse8 .cse10 .cse11 (and .cse2 .cse17 (or .cse18 .cse19 (and .cse20 .cse21)) .cse5) .cse12) .cse2 .cse3 (or .cse22 .cse23 (and (or .cse0 .cse24 .cse25 .cse26 .cse27 .cse1) (or .cse13 .cse24 .cse6 .cse7 .cse28 .cse8 .cse26 .cse14 .cse11) (or .cse24 .cse6 .cse7 .cse28 .cse8 .cse26 .cse14 .cse11 .cse12)) .cse29 .cse30) (or .cse6 .cse7 .cse31 .cse12) (or .cse0 (and (or .cse18 .cse19 (and (or .cse25 .cse22 .cse23 .cse26 .cse27 .cse32 .cse33 .cse30) .cse21)) (or .cse24 .cse34 .cse25 .cse35 .cse36 .cse26 .cse27 .cse37) (or .cse34 .cse25 .cse38 .cse36 .cse26 .cse27 .cse37 .cse32)) .cse1) (or .cse13 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or (and (or .cse34 .cse38 (let ((.cse40 (forall ((~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (= (select (select |c_#memory_int| ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset)) .cse45))))) (and (or .cse25 .cse39 .cse40 .cse41) (or .cse25 .cse42 (and (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse43 (select |c_#memory_int| ~client~0.base))) (let ((.cse44 (select .cse43 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (not (= (select .cse43 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) .cse44)) (<= (+ ~client_back~0 1) v_~client_front~0_112))) (= .cse44 .cse45))))) (< ~client_back~0 0))) (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse47 (select |c_#memory_int| ~client~0.base))) (let ((.cse46 (select .cse47 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (= .cse46 .cse45) (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (= (select .cse47 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) .cse46) (<= (+ ~client_back~0 1) v_~client_front~0_112))))))))))) (or .cse40 .cse28 .cse48 .cse11 .cse49))) .cse26 .cse27 .cse37) .cse50 (or .cse34 (let ((.cse55 (forall ((~node~0.base Int)) (= (select (select |c_#memory_int| ~node~0.base) .cse54) .cse45)))) (and (or .cse28 .cse48 .cse11 .cse51 (forall ((~node~0.base Int)) (let ((.cse52 (select (select |c_#memory_int| ~node~0.base) .cse54))) (or (= .cse52 .cse45) (not (= .cse53 .cse52)))))) (or .cse25 .cse55 .cse42 .cse56) (or .cse25 .cse39 .cse55 .cse51 .cse41))) .cse29 .cse26 .cse27 .cse37) (or .cse34 (and .cse57 .cse58 (or .cse25 .cse48 .cse11 .cse49)) .cse35 .cse26 .cse37 .cse59)) .cse0 .cse1) (or .cse13 .cse60 .cse6 .cse7) (or .cse13 .cse6 .cse61 .cse7) (or .cse60 .cse6 .cse7 .cse12) (or .cse6 .cse61 .cse7 .cse12) (or (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse68 (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int))) (let ((.cse133 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836) c_~manager~0.base))) (= (select .cse133 .cse70) (select .cse133 .cse65)))))) (let ((.cse83 (and (or .cse48 .cse66 (let ((.cse104 (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int) (~node~0.base Int)) (let ((.cse114 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse115 (select .cse114 c_~manager~0.base))) (let ((.cse112 (select .cse114 ~node~0.base)) (.cse113 (select .cse115 .cse65))) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (not (= (select .cse112 (+ .cse85 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse113)) (not (= (select (select .cse114 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset)) (select .cse115 .cse72))) (= (select .cse112 (+ .cse110 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse113)))))))) (and (or .cse28 .cse29 .cse26 .cse37 .cse14 .cse104) (or .cse105 (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse107 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse106 (select .cse107 c_~manager~0.base))) (or (= (select .cse106 .cse70) (select .cse106 .cse72)) (not (= (select (select .cse107 ~node~0.base) (+ .cse85 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse106 .cse65))))))) .cse28 .cse35 .cse26 .cse37) (or .cse105 .cse28 .cse38 .cse26 .cse37 .cse104) (or .cse18 .cse19 .cse108 (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse109 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse109 ~node~0.base) (+ .cse110 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select .cse109 c_~manager~0.base) .cse65)))) .cse111 .cse14))) .cse10) (or .cse39 (let ((.cse117 (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int) (~node~0.base Int)) (let ((.cse119 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (let ((.cse118 (select .cse119 ~node~0.base))) (= (select .cse118 (+ .cse110 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse118 (+ .cse85 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= (select (select .cse119 c_~manager~0.base) .cse65) (select (select .cse119 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset))))))))) (and .cse116 (or .cse68 .cse25 .cse105 .cse35 .cse26 .cse37) (or .cse25 .cse105 .cse117 .cse38 .cse26 .cse37) (or .cse25 .cse117 .cse29 .cse26 .cse37 .cse14))) .cse10 .cse11 .cse41) (or .cse42 .cse10 .cse11 (let ((.cse121 (and (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse127 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse125 (select (select .cse127 c_~manager~0.base) .cse65)) (.cse126 (select .cse127 ~client~0.base))) (or (not (= .cse125 (select .cse126 (+ (* ~client_back~0 4) ~client~0.offset)))) (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (not (= .cse125 (select .cse126 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)))) (<= (+ ~client_back~0 1) v_~client_front~0_112)))))) (< ~client_back~0 0))) (let ((.cse128 (select .cse127 ~node~0.base))) (= (select .cse128 (+ .cse110 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse128 (+ .cse85 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse130 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (let ((.cse129 (select .cse130 ~node~0.base))) (= (select .cse129 (+ .cse110 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse129 (+ .cse85 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse131 (select (select .cse130 c_~manager~0.base) .cse65)) (.cse132 (select .cse130 ~client~0.base))) (or (not (= .cse131 (select .cse132 (+ (* ~client_back~0 4) ~client~0.offset)))) (forall ((v_~client_front~0_112 Int)) (or (= .cse131 (select .cse132 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))) (< v_~client_front~0_112 1) (<= (+ ~client_back~0 1) v_~client_front~0_112)))))))))))))) (and (or .cse18 .cse19 .cse108 .cse111 .cse14 (forall ((v_~client_front~0_112 Int) (v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int)) (or (< c_~client_size~0 (+ v_~client_front~0_112 1)) (< v_~client_front~0_112 1) (not (let ((.cse120 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse120 c_~manager~0.base) .cse65) (select (select .cse120 ~client~0.base) (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)))))))) (or .cse25 .cse105 .cse38 .cse26 .cse37 .cse121) (or .cse25 .cse105 .cse35 (forall ((v_ArrVal_834 (Array Int Int)) (v_~client_front~0_112 Int) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int)) (let ((.cse124 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse122 (select .cse124 c_~manager~0.base))) (let ((.cse123 (select .cse122 .cse65))) (or (< c_~client_size~0 (+ v_~client_front~0_112 1)) (< v_~client_front~0_112 1) (= (select .cse122 .cse70) .cse123) (not (= .cse123 (select (select .cse124 ~client~0.base) (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))))))))) .cse26 .cse37) (or .cse25 .cse29 .cse26 .cse37 .cse14 .cse121))))))) (and (or .cse26 (and (or .cse39 (let ((.cse62 (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (not (let ((.cse64 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse64 c_~manager~0.base) .cse65) (select (select .cse64 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset))))))))) (and (or .cse25 .cse6 .cse62 .cse7 .cse14 .cse11 .cse12) (or .cse13 .cse25 .cse6 .cse62 .cse7 .cse14 .cse11) .cse63)) .cse41) (or .cse48 (let ((.cse67 (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int)) (let ((.cse71 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse69 (select .cse71 c_~manager~0.base))) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (= (select .cse69 .cse70) (select .cse69 .cse65)) (not (= (select (select .cse71 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset)) (select .cse69 .cse72))))))))) (and (or .cse13 .cse6 .cse7 .cse28 .cse66 .cse67 .cse14) (or .cse6 .cse7 .cse28 .cse66 .cse67 .cse14 .cse12) (or .cse68 .cse0 .cse25 .cse1 .cse51))) .cse11) (or .cse42 (let ((.cse73 (and (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse77 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse79 (select .cse77 ~client~0.base))) (let ((.cse78 (select .cse79 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (not (= (select (select .cse77 c_~manager~0.base) .cse65) .cse78)) (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (<= (+ ~client_back~0 1) v_~client_front~0_112) (not (= .cse78 (select .cse79 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))))))))))))) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse80 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse82 (select .cse80 ~client~0.base))) (let ((.cse81 (select .cse82 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (not (= (select (select .cse80 c_~manager~0.base) .cse65) .cse81)) (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (= .cse81 (select .cse82 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))) (<= (+ ~client_back~0 1) v_~client_front~0_112)))))))) (< ~client_back~0 0)))))) (and (or .cse13 .cse25 .cse6 .cse7 .cse14 .cse11 .cse73) (or .cse25 .cse6 .cse7 .cse14 .cse11 .cse12 .cse73) (or .cse0 .cse74 (and (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< v_~client_front~0_112 1) (<= (+ ~client_back~0 1) v_~client_front~0_112) (not (let ((.cse75 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836) ~client~0.base))) (= (select .cse75 (+ (* ~client_back~0 4) ~client~0.offset)) (select .cse75 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))))))))) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< v_~client_front~0_112 1) (let ((.cse76 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836) ~client~0.base))) (= (select .cse76 (+ (* ~client_back~0 4) ~client~0.offset)) (select .cse76 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)))) (<= (+ ~client_back~0 1) v_~client_front~0_112)))))) .cse1 .cse59))))) .cse33) (or .cse13 .cse6 .cse7 .cse83) (or .cse0 .cse1 (and (or .cse34 .cse35 .cse26 .cse37 (and .cse57 .cse58 (or .cse25 .cse48 .cse11 (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (not (let ((.cse84 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse84 ~node~0.base) (+ .cse85 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select .cse84 c_~manager~0.base) .cse65))))))) .cse59) (or .cse34 (and (or .cse28 (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int) (~node~0.base Int)) (let ((.cse86 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse87 (select .cse86 c_~manager~0.base))) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (not (= (select (select .cse86 ~node~0.base) (+ .cse85 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse87 .cse65))) (= (select .cse87 .cse88) (select (select .cse86 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset))))))) .cse48 .cse11) (or .cse25 .cse42 (and (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse89 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse91 (select .cse89 ~client~0.base))) (let ((.cse90 (select .cse91 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (= (select (select .cse89 c_~manager~0.base) .cse88) .cse90) (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (= .cse90 (select .cse91 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))) (<= (+ ~client_back~0 1) v_~client_front~0_112)))))))))) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse94 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse93 (select .cse94 ~client~0.base))) (let ((.cse92 (select .cse93 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (<= (+ ~client_back~0 1) v_~client_front~0_112) (not (= .cse92 (select .cse93 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)))))) (= (select (select .cse94 c_~manager~0.base) .cse88) .cse92)))))))))) (or .cse25 .cse39 (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (let ((.cse95 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse95 c_~manager~0.base) .cse88) (select (select .cse95 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset)))))) .cse41)) .cse38 .cse26 .cse27 .cse37) (or .cse34 (and (or .cse25 .cse42 (and (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse97 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< v_~client_front~0_112 1) (let ((.cse96 (select .cse97 ~client~0.base))) (= (select .cse96 (+ (* ~client_back~0 4) ~client~0.offset)) (select .cse96 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)))) (<= (+ ~client_back~0 1) v_~client_front~0_112))))) (= (select (select .cse97 c_~manager~0.base) .cse88) (select (select .cse97 ~node~0.base) (+ .cse85 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse99 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< v_~client_front~0_112 1) (<= (+ ~client_back~0 1) v_~client_front~0_112) (not (let ((.cse98 (select .cse99 ~client~0.base))) (= (select .cse98 (+ (* ~client_back~0 4) ~client~0.offset)) (select .cse98 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))))))))) (= (select (select .cse99 c_~manager~0.base) .cse88) (select (select .cse99 ~node~0.base) (+ .cse85 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (or .cse28 (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse102 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse101 (select .cse102 c_~manager~0.base)) (.cse100 (select (select .cse102 ~node~0.base) (+ .cse85 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (= .cse100 (select .cse101 .cse65))) (= (select .cse101 .cse88) .cse100))))) .cse48 .cse11 .cse51) (or .cse25 .cse39 (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse103 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse103 c_~manager~0.base) .cse88) (select (select .cse103 ~node~0.base) (+ .cse85 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) .cse51 .cse41)) .cse29 .cse26 .cse27 .cse37) .cse50)) (or .cse6 .cse7 .cse83 .cse12))))) (or .cse13 .cse6 .cse7 .cse8 .cse10 .cse14 .cse11 .cse134) (or .cse26 (and (or .cse39 (and (or .cse25 .cse6 .cse7 .cse14 .cse11 .cse135 .cse12) (or .cse13 .cse25 .cse6 .cse7 .cse14 .cse11 .cse135) .cse63) .cse41) (or (let ((.cse136 (and (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse138 (select |c_#memory_int| ~client~0.base))) (let ((.cse137 (select .cse138 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (not (= .cse53 .cse137)) (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (= (select .cse138 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) .cse137) (<= (+ ~client_back~0 1) v_~client_front~0_112))))))))) (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse140 (select |c_#memory_int| ~client~0.base))) (let ((.cse139 (select .cse140 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (not (= .cse53 .cse139)) (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (not (= (select .cse140 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) .cse139)) (<= (+ ~client_back~0 1) v_~client_front~0_112)))))))))))) (and (or .cse13 .cse25 .cse6 .cse7 .cse136 .cse14 .cse11) (or .cse25 .cse6 .cse7 .cse136 .cse14 .cse11 .cse12) (or .cse0 .cse74 .cse56 .cse1 .cse59))) .cse42) (or .cse48 .cse11 (and (or .cse141 .cse13 .cse6 .cse142 .cse7 .cse28 .cse66 .cse14) (or .cse141 .cse0 .cse25 .cse1 .cse51) (or .cse141 .cse6 .cse142 .cse7 .cse28 .cse66 .cse14 .cse12)))) .cse33) (or .cse26 .cse33 (and (or (let ((.cse143 (forall ((v_ArrVal_836 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int)) (let ((.cse145 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse146 (select .cse145 c_~manager~0.base))) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (not (= (select (select .cse145 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset)) (select .cse146 .cse72))) (= (select .cse146 .cse70) (select .cse146 .cse65)))))))) (and (or .cse13 .cse6 .cse7 .cse28 .cse143 .cse66 .cse14) (or .cse0 .cse25 .cse144 .cse1 .cse51) (or .cse6 .cse7 .cse28 .cse143 .cse66 .cse14 .cse12))) .cse48 .cse11) (or (let ((.cse147 (forall ((v_ArrVal_836 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (not (let ((.cse148 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse148 c_~manager~0.base) .cse65) (select (select .cse148 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset))))) (< ~client_back~0 0))))) (and (or .cse25 .cse6 .cse147 .cse7 .cse14 .cse11 .cse12) (or .cse13 .cse25 .cse6 .cse147 .cse7 .cse14 .cse11) .cse63)) .cse39 .cse41) (or .cse42 (let ((.cse151 (and (forall ((v_ArrVal_836 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse152 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse154 (select .cse152 ~client~0.base))) (let ((.cse153 (select .cse154 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (not (= (select (select .cse152 c_~manager~0.base) .cse65) .cse153)) (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (= (select .cse154 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) .cse153) (<= (+ ~client_back~0 1) v_~client_front~0_112)))))))))) (forall ((v_ArrVal_836 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse155 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse157 (select .cse155 ~client~0.base))) (let ((.cse156 (select .cse157 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (not (= (select (select .cse155 c_~manager~0.base) .cse65) .cse156)) (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (not (= (select .cse157 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) .cse156)) (<= (+ ~client_back~0 1) v_~client_front~0_112)))))))) (< ~client_back~0 0)))))) (and (or .cse0 .cse74 (and (forall ((v_ArrVal_836 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< v_~client_front~0_112 1) (let ((.cse149 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836) ~client~0.base))) (= (select .cse149 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) (select .cse149 (+ (* ~client_back~0 4) ~client~0.offset)))) (<= (+ ~client_back~0 1) v_~client_front~0_112))))) (forall ((v_ArrVal_836 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< v_~client_front~0_112 1) (not (let ((.cse150 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836) ~client~0.base))) (= (select .cse150 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) (select .cse150 (+ (* ~client_back~0 4) ~client~0.offset))))) (<= (+ ~client_back~0 1) v_~client_front~0_112)))))) .cse1 .cse59) (or .cse13 .cse151 .cse25 .cse6 .cse7 .cse14 .cse11) (or .cse151 .cse25 .cse6 .cse7 .cse14 .cse11 .cse12)))))) (or .cse0 (and (or .cse34 .cse35 (and .cse57 .cse58 (or .cse25 (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (not (let ((.cse158 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse158 c_~manager~0.base) .cse65) (select (select .cse158 ~node~0.base) .cse54))))) .cse48 .cse11)) .cse26 .cse37 .cse59) .cse50 (or .cse34 .cse38 .cse26 .cse27 .cse37 (and (or .cse25 .cse39 (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (let ((.cse159 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse159 c_~manager~0.base) .cse88) (select (select .cse159 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset)))))) .cse41) (or (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int) (~node~0.base Int)) (let ((.cse161 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse160 (select .cse161 c_~manager~0.base))) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (not (= (select .cse160 .cse65) (select (select .cse161 ~node~0.base) .cse54))) (= (select .cse160 .cse88) (select (select .cse161 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset))))))) .cse28 .cse48 .cse11) (or .cse25 .cse42 (and (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse164 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse163 (select .cse164 ~client~0.base))) (let ((.cse162 (select .cse163 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (not (= .cse162 (select .cse163 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)))) (<= (+ ~client_back~0 1) v_~client_front~0_112))) (= (select (select .cse164 c_~manager~0.base) .cse88) .cse162)))))))) (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse167 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse166 (select .cse167 ~client~0.base))) (let ((.cse165 (select .cse166 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (forall ((v_~client_front~0_112 Int)) (or (= .cse165 (select .cse166 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))) (< v_~client_front~0_112 1) (<= (+ ~client_back~0 1) v_~client_front~0_112))) (= (select (select .cse167 c_~manager~0.base) .cse88) .cse165)))))))))))) (or .cse34 .cse29 (and (or .cse25 .cse39 .cse51 .cse41 (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse168 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse168 c_~manager~0.base) .cse88) (select (select .cse168 ~node~0.base) .cse54))))) (or .cse28 .cse48 .cse11 (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse171 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse169 (select .cse171 c_~manager~0.base)) (.cse170 (select (select .cse171 ~node~0.base) .cse54))) (or (not (= (select .cse169 .cse65) .cse170)) (= (select .cse169 .cse88) .cse170))))) .cse51) (or (and (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse173 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< v_~client_front~0_112 1) (not (let ((.cse172 (select .cse173 ~client~0.base))) (= (select .cse172 (+ (* ~client_back~0 4) ~client~0.offset)) (select .cse172 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))))) (<= (+ ~client_back~0 1) v_~client_front~0_112))))) (= (select (select .cse173 c_~manager~0.base) .cse88) (select (select .cse173 ~node~0.base) .cse54))))) (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse175 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (let ((.cse174 (select .cse175 ~client~0.base))) (= (select .cse174 (+ (* ~client_back~0 4) ~client~0.offset)) (select .cse174 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)))) (< v_~client_front~0_112 1) (<= (+ ~client_back~0 1) v_~client_front~0_112))) (< ~client_back~0 0))) (= (select (select .cse175 c_~manager~0.base) .cse88) (select (select .cse175 ~node~0.base) .cse54)))))) .cse25 .cse42)) .cse26 .cse27 .cse37)) .cse1) (or .cse0 (and (or .cse24 .cse34 .cse25 .cse22 .cse23 .cse29 .cse176 .cse26 .cse27 .cse37 .cse30) (or .cse34 .cse35 .cse74 .cse177 .cse176 .cse26 .cse37 .cse59) (or .cse18 .cse19 .cse108 .cse111 .cse178) (or .cse34 .cse25 .cse22 .cse23 .cse38 .cse176 .cse26 .cse27 .cse37 .cse32 .cse30)) .cse1) (= c_~safe~0 1) (or (let ((.cse180 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_165| Int) (v_ArrVal_832 Int) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_165|) 0)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_165| v_ArrVal_832) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164|) 0)))))) (and (or .cse25 .cse39 .cse35 (= .cse179 c_~manager_back~0) .cse180 .cse26 .cse11 .cse41) (or .cse0 (and (or .cse18 .cse19 (and .cse181 .cse182) .cse108 .cse180 .cse111) (or .cse35 (and (or .cse25 .cse48 .cse180 .cse11) (or .cse39 .cse74 .cse180 .cse41)) .cse26 .cse59)) .cse1) (or (= c_~manager_back~0 c_~manager_front~0) .cse28 .cse35 .cse48 .cse66 .cse180 .cse26))) (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (let ((.cse203 (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int))) (let ((.cse241 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836) c_~manager~0.base))) (= (select .cse241 .cse65) (select .cse241 .cse70)))))) (let ((.cse183 (and (or (let ((.cse217 (and (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_834 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse223 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (let ((.cse222 (select .cse223 ~node~0.base))) (= (select .cse222 (+ .cse110 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse222 (+ .cse85 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse224 (select (select .cse223 c_~manager~0.base) .cse65)) (.cse225 (select .cse223 ~client~0.base))) (or (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (= .cse224 (select .cse225 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))) (<= (+ ~client_back~0 1) v_~client_front~0_112))) (not (= .cse224 (select .cse225 (+ (* ~client_back~0 4) ~client~0.offset)))))))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_834 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse227 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (let ((.cse226 (select .cse227 ~node~0.base))) (= (select .cse226 (+ .cse110 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse226 (+ .cse85 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse228 (select (select .cse227 c_~manager~0.base) .cse65)) (.cse229 (select .cse227 ~client~0.base))) (or (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (not (= .cse228 (select .cse229 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)))) (<= (+ ~client_back~0 1) v_~client_front~0_112))) (not (= .cse228 (select .cse229 (+ (* ~client_back~0 4) ~client~0.offset))))))) (< ~client_back~0 0))))))))) (and (or .cse25 .cse217 .cse29 .cse26 .cse37 .cse14) (or .cse25 .cse105 .cse217 .cse38 .cse26 .cse37) (or .cse25 .cse105 .cse35 .cse26 .cse37 (forall ((v_ArrVal_834 (Array Int Int)) (v_~client_front~0_112 Int) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int)) (let ((.cse220 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse219 (select .cse220 c_~manager~0.base))) (let ((.cse218 (select .cse219 .cse65))) (or (= .cse218 (select .cse219 .cse70)) (< c_~client_size~0 (+ v_~client_front~0_112 1)) (< v_~client_front~0_112 1) (not (= .cse218 (select (select .cse220 ~client~0.base) (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)))))))))) (or .cse18 .cse19 (forall ((v_ArrVal_834 (Array Int Int)) (v_~client_front~0_112 Int) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int)) (or (< c_~client_size~0 (+ v_~client_front~0_112 1)) (< v_~client_front~0_112 1) (not (let ((.cse221 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse221 c_~manager~0.base) .cse65) (select (select .cse221 ~client~0.base) (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))))))) .cse108 .cse111 .cse14))) .cse42 .cse10 .cse11) (or .cse39 (let ((.cse230 (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int) (~node~0.base Int)) (let ((.cse232 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (<= c_~client_size~0 ~client_back~0) (let ((.cse231 (select .cse232 ~node~0.base))) (= (select .cse231 (+ .cse110 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse231 (+ .cse85 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< ~client_back~0 0) (not (= (select (select .cse232 c_~manager~0.base) .cse65) (select (select .cse232 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset))))))))) (and (or .cse25 .cse203 .cse105 .cse35 .cse26 .cse37) .cse116 (or .cse25 .cse105 .cse38 .cse26 .cse37 .cse230) (or .cse25 .cse29 .cse26 .cse37 .cse14 .cse230))) .cse10 .cse11 .cse41) (or .cse48 .cse66 .cse10 (let ((.cse234 (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int) (~node~0.base Int)) (let ((.cse238 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse237 (select .cse238 c_~manager~0.base))) (let ((.cse239 (select .cse238 ~node~0.base)) (.cse240 (select .cse237 .cse65))) (or (<= c_~client_size~0 ~client_back~0) (not (= (select .cse237 .cse72) (select (select .cse238 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset)))) (< ~client_back~0 0) (not (= (select .cse239 (+ .cse85 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse240)) (= (select .cse239 (+ .cse110 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse240)))))))) (and (or .cse18 .cse19 (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse233 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse233 ~node~0.base) (+ .cse110 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select .cse233 c_~manager~0.base) .cse65)))) .cse108 .cse111 .cse14) (or .cse105 .cse28 .cse38 .cse26 .cse37 .cse234) (or .cse105 (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse236 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse235 (select .cse236 c_~manager~0.base))) (or (= (select .cse235 .cse72) (select .cse235 .cse70)) (not (= (select (select .cse236 ~node~0.base) (+ .cse85 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse235 .cse65))))))) .cse28 .cse35 .cse26 .cse37) (or .cse28 .cse29 .cse26 .cse37 .cse14 .cse234))))))) (and (or .cse6 .cse183 .cse7 .cse12) (or .cse0 (and (or .cse34 .cse38 .cse26 .cse27 .cse37 (and (or .cse25 .cse42 (and (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse184 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse186 (select .cse184 ~client~0.base))) (let ((.cse185 (select .cse186 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (= (select (select .cse184 c_~manager~0.base) .cse88) .cse185) (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (= (select .cse186 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) .cse185) (<= (+ ~client_back~0 1) v_~client_front~0_112)))))))))) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse189 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse187 (select .cse189 ~client~0.base))) (let ((.cse188 (select .cse187 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (not (= (select .cse187 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) .cse188)) (<= (+ ~client_back~0 1) v_~client_front~0_112))) (= (select (select .cse189 c_~manager~0.base) .cse88) .cse188)))))))))) (or .cse25 .cse39 (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (let ((.cse190 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse190 c_~manager~0.base) .cse88) (select (select .cse190 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset)))))) .cse41) (or (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int) (~node~0.base Int)) (let ((.cse191 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse192 (select .cse191 c_~manager~0.base))) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (not (= (select (select .cse191 ~node~0.base) (+ .cse85 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse192 .cse65))) (= (select .cse192 .cse88) (select (select .cse191 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset))))))) .cse28 .cse48 .cse11))) (or .cse34 .cse35 (and .cse57 (or (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (not (let ((.cse193 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse193 ~node~0.base) (+ .cse85 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select .cse193 c_~manager~0.base) .cse65))))) .cse25 .cse48 .cse11) .cse58) .cse26 .cse37 .cse59) .cse50 (or .cse34 .cse29 .cse26 .cse27 .cse37 (and (or .cse25 .cse42 (and (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_834 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse195 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< v_~client_front~0_112 1) (not (let ((.cse194 (select .cse195 ~client~0.base))) (= (select .cse194 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) (select .cse194 (+ (* ~client_back~0 4) ~client~0.offset))))) (<= (+ ~client_back~0 1) v_~client_front~0_112))))) (= (select (select .cse195 c_~manager~0.base) .cse88) (select (select .cse195 ~node~0.base) (+ .cse85 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_834 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse197 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< v_~client_front~0_112 1) (let ((.cse196 (select .cse197 ~client~0.base))) (= (select .cse196 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) (select .cse196 (+ (* ~client_back~0 4) ~client~0.offset)))) (<= (+ ~client_back~0 1) v_~client_front~0_112))))) (= (select (select .cse197 c_~manager~0.base) .cse88) (select (select .cse197 ~node~0.base) (+ .cse85 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (or .cse25 .cse39 (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse198 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse198 c_~manager~0.base) .cse88) (select (select .cse198 ~node~0.base) (+ .cse85 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) .cse51 .cse41) (or .cse28 (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse201 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse200 (select (select .cse201 ~node~0.base) (+ .cse85 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse199 (select .cse201 c_~manager~0.base))) (or (= (select .cse199 .cse88) .cse200) (not (= .cse200 (select .cse199 .cse65))))))) .cse48 .cse11 .cse51)))) .cse1) (or (and (or .cse48 (let ((.cse202 (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int)) (let ((.cse205 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse204 (select .cse205 c_~manager~0.base))) (or (<= c_~client_size~0 ~client_back~0) (= (select .cse204 .cse65) (select .cse204 .cse70)) (not (= (select .cse204 .cse72) (select (select .cse205 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset)))) (< ~client_back~0 0))))))) (and (or .cse6 .cse202 .cse7 .cse28 .cse66 .cse14 .cse12) (or .cse13 .cse6 .cse202 .cse7 .cse28 .cse66 .cse14) (or .cse0 .cse25 .cse203 .cse1 .cse51))) .cse11) (or .cse42 (let ((.cse206 (and (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse209 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse211 (select .cse209 ~client~0.base))) (let ((.cse210 (select .cse211 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (not (= (select (select .cse209 c_~manager~0.base) .cse65) .cse210)) (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (= (select .cse211 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) .cse210) (<= (+ ~client_back~0 1) v_~client_front~0_112)))))))) (< ~client_back~0 0))) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse214 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse212 (select .cse214 ~client~0.base))) (let ((.cse213 (select .cse212 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (not (= (select .cse212 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) .cse213)) (<= (+ ~client_back~0 1) v_~client_front~0_112))) (not (= (select (select .cse214 c_~manager~0.base) .cse65) .cse213)))))))))))) (and (or .cse25 .cse6 .cse7 .cse206 .cse14 .cse11 .cse12) (or .cse0 .cse74 .cse1 .cse59 (and (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< v_~client_front~0_112 1) (let ((.cse207 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836) ~client~0.base))) (= (select .cse207 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) (select .cse207 (+ (* ~client_back~0 4) ~client~0.offset)))) (<= (+ ~client_back~0 1) v_~client_front~0_112))))) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< v_~client_front~0_112 1) (not (let ((.cse208 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836) ~client~0.base))) (= (select .cse208 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) (select .cse208 (+ (* ~client_back~0 4) ~client~0.offset))))) (<= (+ ~client_back~0 1) v_~client_front~0_112))))))) (or .cse13 .cse25 .cse6 .cse7 .cse206 .cse14 .cse11)))) (or .cse39 (let ((.cse215 (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (not (let ((.cse216 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse216 c_~manager~0.base) .cse65) (select (select .cse216 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset))))))))) (and (or .cse25 .cse6 .cse215 .cse7 .cse14 .cse11 .cse12) (or .cse13 .cse25 .cse6 .cse215 .cse7 .cse14 .cse11) .cse63)) .cse41)) .cse26 .cse33) (or .cse13 .cse6 .cse183 .cse7)))) .cse242) (or .cse22 .cse23 .cse26 (let ((.cse243 (= .cse244 c_~update~0))) (and (or .cse25 .cse6 .cse7 .cse8 .cse243 .cse14 .cse11 .cse12) (or .cse13 .cse25 .cse6 .cse7 .cse8 .cse243 .cse14 .cse11) (or .cse0 .cse74 .cse243 .cse1 .cse59))) .cse33 .cse30) (or .cse13 .cse6 .cse7 .cse31) (or .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse245) (or .cse26 (and (or .cse48 .cse11 (let ((.cse246 (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int)) (let ((.cse249 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse248 (select .cse249 c_~manager~0.base))) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (not (= (select .cse248 .cse72) (select (select .cse249 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset)))) (= (select .cse248 .cse65) (select .cse248 .cse70)))))))) (and (or .cse6 .cse7 .cse246 .cse28 .cse66 .cse14 .cse12) (or .cse0 .cse25 .cse247 .cse1 .cse51) (or .cse13 .cse6 .cse7 .cse246 .cse28 .cse66 .cse14)))) (or .cse42 (let ((.cse250 (and (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse255 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse254 (select .cse255 ~client~0.base))) (let ((.cse253 (select .cse254 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (forall ((v_~client_front~0_112 Int)) (or (= .cse253 (select .cse254 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))) (< v_~client_front~0_112 1) (<= (+ ~client_back~0 1) v_~client_front~0_112))) (not (= (select (select .cse255 c_~manager~0.base) .cse65) .cse253))))))))) (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse258 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse257 (select .cse258 ~client~0.base))) (let ((.cse256 (select .cse257 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (not (= .cse256 (select .cse257 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)))) (<= (+ ~client_back~0 1) v_~client_front~0_112))) (not (= (select (select .cse258 c_~manager~0.base) .cse65) .cse256))))))) (< ~client_back~0 0)))))) (and (or .cse13 .cse25 .cse6 .cse7 .cse250 .cse14 .cse11) (or .cse0 .cse74 .cse1 .cse59 (and (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (let ((.cse251 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836) ~client~0.base))) (= (select .cse251 (+ (* ~client_back~0 4) ~client~0.offset)) (select .cse251 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)))) (< v_~client_front~0_112 1) (<= (+ ~client_back~0 1) v_~client_front~0_112))) (< ~client_back~0 0))) (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< v_~client_front~0_112 1) (not (let ((.cse252 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836) ~client~0.base))) (= (select .cse252 (+ (* ~client_back~0 4) ~client~0.offset)) (select .cse252 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))))) (<= (+ ~client_back~0 1) v_~client_front~0_112))))))) (or .cse25 .cse6 .cse7 .cse250 .cse14 .cse11 .cse12)))) (or (let ((.cse259 (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (not (let ((.cse260 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse260 c_~manager~0.base) .cse65) (select (select .cse260 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset))))))))) (and (or .cse25 .cse6 .cse7 .cse259 .cse14 .cse11 .cse12) (or .cse13 .cse25 .cse6 .cse7 .cse259 .cse14 .cse11) .cse63)) .cse39 .cse41)) .cse33) .cse4 .cse5 (or .cse6 .cse7 .cse8 .cse10 .cse14 .cse11 .cse134 .cse12) (or .cse13 .cse6 .cse7 .cse8 .cse10 .cse11 .cse245) (or .cse0 (and (or .cse34 .cse29 (and (or .cse25 .cse42 (and (forall ((v_ArrVal_836 (Array Int Int)) (~node~0.base Int)) (let ((.cse262 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< v_~client_front~0_112 1) (not (let ((.cse261 (select .cse262 ~client~0.base))) (= (select .cse261 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) (select .cse261 (+ (* ~client_back~0 4) ~client~0.offset))))) (<= (+ ~client_back~0 1) v_~client_front~0_112))))) (= (select (select .cse262 c_~manager~0.base) .cse88) (select (select .cse262 ~node~0.base) .cse54))))) (forall ((v_ArrVal_836 (Array Int Int)) (~node~0.base Int)) (let ((.cse264 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< v_~client_front~0_112 1) (let ((.cse263 (select .cse264 ~client~0.base))) (= (select .cse263 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) (select .cse263 (+ (* ~client_back~0 4) ~client~0.offset)))) (<= (+ ~client_back~0 1) v_~client_front~0_112))))) (= (select (select .cse264 c_~manager~0.base) .cse88) (select (select .cse264 ~node~0.base) .cse54))))))) (or .cse25 .cse39 (forall ((v_ArrVal_836 (Array Int Int)) (~node~0.base Int)) (let ((.cse265 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse265 c_~manager~0.base) .cse88) (select (select .cse265 ~node~0.base) .cse54)))) .cse51 .cse41) (or .cse28 (forall ((v_ArrVal_836 (Array Int Int)) (~node~0.base Int)) (let ((.cse268 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse267 (select .cse268 c_~manager~0.base)) (.cse266 (select (select .cse268 ~node~0.base) .cse54))) (or (not (= .cse266 (select .cse267 .cse65))) (= (select .cse267 .cse88) .cse266))))) .cse48 .cse11 .cse51)) .cse26 .cse27 .cse37) (or .cse34 .cse35 .cse26 .cse37 (and .cse57 .cse58 (or .cse25 .cse48 (forall ((v_ArrVal_836 (Array Int Int)) (~node~0.base Int)) (not (let ((.cse269 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse269 ~node~0.base) .cse54) (select (select .cse269 c_~manager~0.base) .cse65))))) .cse11)) .cse59) .cse50 (or .cse34 .cse38 .cse26 .cse27 .cse37 (and (or .cse25 .cse39 (forall ((v_ArrVal_836 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (let ((.cse270 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse270 c_~manager~0.base) .cse88) (select (select .cse270 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset)))))) .cse41) (or .cse25 (and (forall ((v_ArrVal_836 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse273 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse271 (select .cse273 ~client~0.base))) (let ((.cse272 (select .cse271 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (not (= (select .cse271 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) .cse272)) (<= (+ ~client_back~0 1) v_~client_front~0_112))) (= (select (select .cse273 c_~manager~0.base) .cse88) .cse272)))))) (< ~client_back~0 0))) (forall ((v_ArrVal_836 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse274 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse276 (select .cse274 ~client~0.base))) (let ((.cse275 (select .cse276 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (= (select (select .cse274 c_~manager~0.base) .cse88) .cse275) (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (= (select .cse276 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) .cse275) (<= (+ ~client_back~0 1) v_~client_front~0_112))))))))))) .cse42) (or (forall ((v_ArrVal_836 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int) (~node~0.base Int)) (let ((.cse277 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse278 (select .cse277 c_~manager~0.base))) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (not (= (select (select .cse277 ~node~0.base) .cse54) (select .cse278 .cse65))) (= (select .cse278 .cse88) (select (select .cse277 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset))))))) .cse28 .cse48 .cse11)))) .cse1) (or .cse242 (let ((.cse280 (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| Int)) (or (let ((.cse309 (select (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836) c_~manager~0.base))) (= (select .cse309 .cse70) (select .cse309 .cse65))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164|) 0)))))) (let ((.cse279 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164|) 0)))) (.cse303 (and (or .cse25 (forall ((v_~client_front~0_112 Int) (v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| Int)) (let ((.cse304 (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse306 (select .cse304 c_~manager~0.base))) (let ((.cse305 (select .cse306 .cse65))) (or (not (= (select (select .cse304 ~client~0.base) (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)) .cse305)) (< c_~client_size~0 (+ v_~client_front~0_112 1)) (< v_~client_front~0_112 1) (= (select .cse306 .cse70) .cse305) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164|) 0))))))) .cse42 .cse35 .cse26 .cse11) (or .cse28 .cse35 .cse48 .cse66 (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (v_~node_back~0_131 Int) (~node~0.base Int) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| Int)) (let ((.cse308 (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse307 (select .cse308 c_~manager~0.base))) (or (not (= (select .cse307 .cse65) (select (select .cse308 ~node~0.base) (+ (* 4 v_~node_back~0_131) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< v_~node_back~0_131 0) (< 0 v_~node_back~0_131) (= (select .cse307 .cse70) (select .cse307 .cse72)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164|) 0)))))) .cse26) (or .cse25 .cse280 .cse39 .cse35 .cse26 .cse11 .cse41)))) (and (or (and (or .cse0 .cse279 .cse39 .cse74 .cse1 .cse59 .cse51 .cse41) (or .cse0 .cse25 .cse280 .cse48 .cse11 .cse1 .cse51) (or .cse0 .cse42 .cse74 .cse1 .cse59 (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164|) 0)) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< v_~client_front~0_112 1) (<= (+ ~client_back~0 1) v_~client_front~0_112) (not (let ((.cse281 (select (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836) ~client~0.base))) (= (select .cse281 (+ (* ~client_back~0 4) ~client~0.offset)) (select .cse281 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))))))) (< ~client_back~0 0))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164|) 0)) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< v_~client_front~0_112 1) (<= (+ ~client_back~0 1) v_~client_front~0_112) (let ((.cse282 (select (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836) ~client~0.base))) (= (select .cse282 (+ (* ~client_back~0 4) ~client~0.offset)) (select .cse282 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))))))))))))) .cse26 .cse33) (or .cse0 .cse1 (and (or .cse29 (and (or (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (v_~node_back~0_131 Int) (~node~0.base Int) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| Int)) (let ((.cse285 (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse284 (select (select .cse285 ~node~0.base) (+ (* 4 v_~node_back~0_131) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse283 (select .cse285 c_~manager~0.base))) (or (not (= (select .cse283 .cse65) .cse284)) (< v_~node_back~0_131 0) (= .cse284 (select .cse283 .cse88)) (< 0 v_~node_back~0_131) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164|) 0)))))) .cse28 .cse48 .cse11 .cse51) (or .cse25 .cse42 (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164|) 0)) (forall ((v_~node_back~0_131 Int)) (or (< v_~node_back~0_131 0) (< 0 v_~node_back~0_131) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse286 (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (= (select (select .cse286 ~node~0.base) (+ (* 4 v_~node_back~0_131) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select .cse286 c_~manager~0.base) .cse88)) (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< v_~client_front~0_112 1) (<= (+ ~client_back~0 1) v_~client_front~0_112) (not (let ((.cse287 (select .cse286 ~client~0.base))) (= (select .cse287 (+ (* ~client_back~0 4) ~client~0.offset)) (select .cse287 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))))))) (< ~client_back~0 0)))))))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164|) 0)) (forall ((v_~node_back~0_131 Int)) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~node~0.base Int)) (let ((.cse289 (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (or (forall ((~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((v_~client_front~0_112 Int) (~client~0.base Int) (~client~0.offset Int)) (or (< v_~client_front~0_112 1) (<= (+ ~client_back~0 1) v_~client_front~0_112) (let ((.cse288 (select .cse289 ~client~0.base))) (= (select .cse288 (+ (* ~client_back~0 4) ~client~0.offset)) (select .cse288 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset)))))))) (= (select (select .cse289 ~node~0.base) (+ (* 4 v_~node_back~0_131) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select .cse289 c_~manager~0.base) .cse88))))) (< v_~node_back~0_131 0) (< 0 v_~node_back~0_131))))))) (or .cse25 .cse39 (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (v_~node_back~0_131 Int) (~node~0.base Int) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| Int)) (or (< v_~node_back~0_131 0) (let ((.cse290 (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse290 ~node~0.base) (+ (* 4 v_~node_back~0_131) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select .cse290 c_~manager~0.base) .cse88))) (< 0 v_~node_back~0_131) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164|) 0)))) .cse51 .cse41)) .cse26 .cse27) (or .cse38 .cse26 .cse27 (and (or .cse25 .cse42 (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| Int)) (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse293 (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse292 (select .cse293 ~client~0.base))) (let ((.cse291 (select .cse292 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (<= (+ ~client_back~0 1) v_~client_front~0_112) (= .cse291 (select .cse292 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))))) (= .cse291 (select (select .cse293 c_~manager~0.base) .cse88))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164|) 0)))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| Int)) (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client_back~0 Int)) (or (<= c_~client_size~0 ~client_back~0) (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse295 (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse296 (select .cse295 ~client~0.base))) (let ((.cse294 (select .cse296 (+ (* ~client_back~0 4) ~client~0.offset)))) (or (= .cse294 (select (select .cse295 c_~manager~0.base) .cse88)) (forall ((v_~client_front~0_112 Int)) (or (< v_~client_front~0_112 1) (<= (+ ~client_back~0 1) v_~client_front~0_112) (not (= .cse294 (select .cse296 (+ (* v_~client_front~0_112 4) (- 4) ~client~0.offset))))))))))) (< ~client_back~0 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164|) 0)))))) (or .cse25 .cse39 (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (~client~0.offset Int) (~client_back~0 Int) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| Int)) (or (<= c_~client_size~0 ~client_back~0) (< ~client_back~0 0) (let ((.cse297 (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse297 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset)) (select (select .cse297 c_~manager~0.base) .cse88))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164|) 0)))) .cse41) (or (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (~client~0.base Int) (v_~node_back~0_131 Int) (~client~0.offset Int) (~client_back~0 Int) (~node~0.base Int) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| Int)) (let ((.cse299 (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (let ((.cse298 (select .cse299 c_~manager~0.base))) (or (<= c_~client_size~0 ~client_back~0) (not (= (select .cse298 .cse65) (select (select .cse299 ~node~0.base) (+ (* 4 v_~node_back~0_131) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< ~client_back~0 0) (< v_~node_back~0_131 0) (< 0 v_~node_back~0_131) (= (select (select .cse299 ~client~0.base) (+ (* ~client_back~0 4) ~client~0.offset)) (select .cse298 .cse88)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164|) 0)))))) .cse28 .cse48 .cse11))) (or .cse279 .cse18 .cse19 .cse108 .cse300 .cse111) (or (and (or .cse279 .cse301 .cse42 .cse74) (or .cse279 .cse39 .cse74 .cse41) (or .cse25 .cse48 (forall ((v_ArrVal_834 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_836 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (v_~node_back~0_131 Int) (~node~0.base Int) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| Int)) (or (not (let ((.cse302 (store (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164| v_ArrVal_833) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_836))) (= (select (select .cse302 c_~manager~0.base) .cse65) (select (select .cse302 ~node~0.base) (+ (* 4 v_~node_back~0_131) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (< v_~node_back~0_131 0) (< 0 v_~node_back~0_131) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_164|) 0)))) .cse11)) .cse35 .cse26 .cse59))) (or .cse303 .cse12) (or .cse13 .cse303)))))))))))) is different from false [2023-01-27 21:22:39,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:22:51,581 WARN L222 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 290 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:22:53,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:22:57,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:22:59,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:23:07,188 WARN L222 SmtUtils]: Spent 5.91s on a formula simplification. DAG size of input: 284 DAG size of output: 281 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:23:09,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:23:10,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:23:14,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:23:17,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:23:19,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:23:22,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:23:24,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:23:26,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:23:34,873 WARN L222 SmtUtils]: Spent 6.29s on a formula simplification. DAG size of input: 281 DAG size of output: 278 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:23:37,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:23:39,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:23:44,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:23:46,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:23:47,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:23:50,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:23:51,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:23:55,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:23:57,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:23:59,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:24:01,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:24:03,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:24:05,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:24:09,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:24:11,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:24:12,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:24:14,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:24:16,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:25:10,592 WARN L222 SmtUtils]: Spent 46.01s on a formula simplification. DAG size of input: 259 DAG size of output: 256 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:25:13,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:25:15,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:25:18,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:25:20,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:25:23,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:25:25,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:25:28,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:25:30,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:25:32,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:25:34,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:25:37,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:25:38,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:25:41,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:25:43,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:25:46,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:25:48,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:25:51,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:25:52,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:25:55,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:25:58,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:26:01,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:26:03,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:26:05,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:26:08,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:26:09,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:26:12,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:26:14,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:26:16,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:26:18,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:26:21,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:26:23,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:26:25,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:26:27,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:26:30,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:26:32,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:26:36,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:26:39,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:26:41,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:26:43,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:26:45,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:26:49,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:26:51,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:26:52,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:26:55,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:26:57,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:26:59,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:27:01,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:27:04,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:27:06,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:27:09,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:27:10,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:27:14,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:27:16,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:27:18,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:27:21,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:27:23,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:27:27,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:27:28,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:27:31,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:27:33,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:27:36,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:27:38,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:27:41,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-01-27 21:27:43,055 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-27 21:27:43,055 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-27 21:27:44,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-01-27 21:27:44,256 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-01-27 21:27:44,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-01-27 21:27:44,338 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-01-27 21:27:44,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-01-27 21:27:44,338 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-01-27 21:27:44,339 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-01-27 21:27:44,339 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-01-27 21:27:44,339 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-01-27 21:27:44,340 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:27:44,342 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 21:27:44,342 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 21:27:44,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 09:27:44 BasicIcfg [2023-01-27 21:27:44,343 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 21:27:44,344 INFO L158 Benchmark]: Toolchain (without parser) took 847018.13ms. Allocated memory was 679.5MB in the beginning and 2.3GB in the end (delta: 1.6GB). Free memory was 630.0MB in the beginning and 1.0GB in the end (delta: -410.0MB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. [2023-01-27 21:27:44,344 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 390.1MB. Free memory is still 339.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 21:27:44,344 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.94ms. Allocated memory is still 679.5MB. Free memory was 629.7MB in the beginning and 617.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-01-27 21:27:44,344 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.24ms. Allocated memory is still 679.5MB. Free memory was 617.0MB in the beginning and 614.1MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 21:27:44,344 INFO L158 Benchmark]: Boogie Preprocessor took 52.11ms. Allocated memory is still 679.5MB. Free memory was 614.1MB in the beginning and 612.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 21:27:44,344 INFO L158 Benchmark]: RCFGBuilder took 811.23ms. Allocated memory is still 679.5MB. Free memory was 612.0MB in the beginning and 626.7MB in the end (delta: -14.7MB). Peak memory consumption was 38.0MB. Max. memory is 16.0GB. [2023-01-27 21:27:44,357 INFO L158 Benchmark]: TraceAbstraction took 845842.05ms. Allocated memory was 679.5MB in the beginning and 2.3GB in the end (delta: 1.6GB). Free memory was 625.7MB in the beginning and 1.0GB in the end (delta: -414.3MB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. [2023-01-27 21:27:44,361 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 390.1MB. Free memory is still 339.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 258.94ms. Allocated memory is still 679.5MB. Free memory was 629.7MB in the beginning and 617.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 46.24ms. Allocated memory is still 679.5MB. Free memory was 617.0MB in the beginning and 614.1MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 52.11ms. Allocated memory is still 679.5MB. Free memory was 614.1MB in the beginning and 612.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 811.23ms. Allocated memory is still 679.5MB. Free memory was 612.0MB in the beginning and 626.7MB in the end (delta: -14.7MB). Peak memory consumption was 38.0MB. Max. memory is 16.0GB. * TraceAbstraction took 845842.05ms. Allocated memory was 679.5MB in the beginning and 2.3GB in the end (delta: 1.6GB). Free memory was 625.7MB in the beginning and 1.0GB in the end (delta: -414.3MB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.7s, 237 PlacesBefore, 29 PlacesAfterwards, 254 TransitionsBefore, 25 TransitionsAfterwards, 2700 CoEnabledTransitionPairs, 8 FixpointIterations, 163 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 30 TrivialYvCompositions, 12 ConcurrentYvCompositions, 21 ChoiceCompositions, 277 TotalNumberOfCompositions, 2578 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2551, independent: 2539, independent conditional: 0, independent unconditional: 2539, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1493, independent: 1489, independent conditional: 0, independent unconditional: 1489, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2551, independent: 1050, independent conditional: 0, independent unconditional: 1050, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 1493, unknown conditional: 0, unknown unconditional: 1493] , Statistics on independence cache: Total cache size (in pairs): 35, Positive cache size: 33, Positive conditional cache size: 0, Positive unconditional cache size: 33, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 162]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 155]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 156]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 281 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 845.7s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 444.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.8s, HoareTripleCheckerStatistics: 297 mSolverCounterUnknown, 4160 SdHoareTripleChecker+Valid, 255.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4160 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 253.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 613 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 336 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8061 IncrementalHoareTripleChecker+Invalid, 9308 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 336 mSolverCounterUnsat, 0 mSDtfsCounter, 8061 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 872 GetRequests, 485 SyntacticMatches, 1 SemanticMatches, 386 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2779 ImplicationChecksByTransitivity, 304.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3215occurred in iteration=16, InterpolantAutomatonStates: 223, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 388.0s InterpolantComputationTime, 721 NumberOfCodeBlocks, 721 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 999 ConstructedInterpolants, 48 QuantifiedInterpolants, 70279 SizeOfPredicates, 567 NumberOfNonLiveVariables, 4109 ConjunctsInSsa, 256 ConjunctsInUnsatCore, 43 InterpolantComputations, 4 PerfectInterpolantSequences, 141/306 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown