/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 19:09:44,784 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 19:09:44,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 19:09:44,813 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 19:09:44,814 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 19:09:44,814 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 19:09:44,815 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 19:09:44,816 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 19:09:44,817 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 19:09:44,818 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 19:09:44,819 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 19:09:44,819 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 19:09:44,820 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 19:09:44,820 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 19:09:44,821 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 19:09:44,822 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 19:09:44,822 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 19:09:44,823 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 19:09:44,824 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 19:09:44,825 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 19:09:44,826 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 19:09:44,827 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 19:09:44,828 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 19:09:44,828 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 19:09:44,830 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 19:09:44,830 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 19:09:44,830 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 19:09:44,831 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 19:09:44,831 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 19:09:44,831 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 19:09:44,832 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 19:09:44,832 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 19:09:44,833 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 19:09:44,833 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 19:09:44,834 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 19:09:44,834 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 19:09:44,834 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 19:09:44,834 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 19:09:44,834 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 19:09:44,835 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 19:09:44,835 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 19:09:44,840 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 19:09:44,857 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 19:09:44,857 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 19:09:44,857 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 19:09:44,858 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 19:09:44,858 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 19:09:44,858 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 19:09:44,858 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 19:09:44,858 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 19:09:44,859 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 19:09:44,859 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 19:09:44,859 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 19:09:44,859 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 19:09:44,859 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 19:09:44,859 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 19:09:44,859 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 19:09:44,859 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 19:09:44,859 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 19:09:44,859 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 19:09:44,860 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 19:09:44,860 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 19:09:44,860 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 19:09:44,860 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 19:09:44,860 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 19:09:44,861 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:09:44,861 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 19:09:44,861 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 19:09:44,861 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 19:09:44,862 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 19:09:44,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 19:09:44,863 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 19:09:44,863 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 19:09:44,863 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 19:09:44,863 INFO L138 SettingsManager]: * Interpolant automaton=MCR 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 [2022-03-15 19:09:45,036 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 19:09:45,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 19:09:45,069 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 19:09:45,069 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 19:09:45,072 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 19:09:45,073 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c [2022-03-15 19:09:45,128 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe8bfc5ee/19f229cb7f53498aa4d3ecf5f237f9c1/FLAG97d04c73a [2022-03-15 19:09:45,470 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 19:09:45,471 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c [2022-03-15 19:09:45,475 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe8bfc5ee/19f229cb7f53498aa4d3ecf5f237f9c1/FLAG97d04c73a [2022-03-15 19:09:45,906 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe8bfc5ee/19f229cb7f53498aa4d3ecf5f237f9c1 [2022-03-15 19:09:45,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 19:09:45,909 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 19:09:45,910 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 19:09:45,910 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 19:09:45,912 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 19:09:45,912 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:09:45" (1/1) ... [2022-03-15 19:09:45,913 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62664b2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:09:45, skipping insertion in model container [2022-03-15 19:09:45,913 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:09:45" (1/1) ... [2022-03-15 19:09:45,918 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 19:09:45,935 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 19:09:46,086 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c[2947,2960] [2022-03-15 19:09:46,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:09:46,095 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 19:09:46,108 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c[2947,2960] [2022-03-15 19:09:46,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:09:46,120 INFO L208 MainTranslator]: Completed translation [2022-03-15 19:09:46,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:09:46 WrapperNode [2022-03-15 19:09:46,121 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 19:09:46,122 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 19:09:46,122 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 19:09:46,122 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 19:09:46,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:09:46" (1/1) ... [2022-03-15 19:09:46,139 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:09:46" (1/1) ... [2022-03-15 19:09:46,162 INFO L137 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 151 [2022-03-15 19:09:46,162 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 19:09:46,163 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 19:09:46,163 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 19:09:46,163 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 19:09:46,169 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:09:46" (1/1) ... [2022-03-15 19:09:46,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:09:46" (1/1) ... [2022-03-15 19:09:46,181 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:09:46" (1/1) ... [2022-03-15 19:09:46,181 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:09:46" (1/1) ... [2022-03-15 19:09:46,190 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:09:46" (1/1) ... [2022-03-15 19:09:46,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:09:46" (1/1) ... [2022-03-15 19:09:46,194 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:09:46" (1/1) ... [2022-03-15 19:09:46,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 19:09:46,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 19:09:46,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 19:09:46,196 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 19:09:46,201 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:09:46" (1/1) ... [2022-03-15 19:09:46,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:09:46,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:09:46,223 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) [2022-03-15 19:09:46,242 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 [2022-03-15 19:09:46,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 19:09:46,253 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 19:09:46,253 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 19:09:46,253 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 19:09:46,253 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 19:09:46,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 19:09:46,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 19:09:46,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 19:09:46,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 19:09:46,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 19:09:46,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 19:09:46,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 19:09:46,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 19:09:46,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 19:09:46,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 19:09:46,256 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 19:09:46,313 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 19:09:46,314 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 19:09:46,476 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 19:09:46,534 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 19:09:46,534 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-15 19:09:46,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:09:46 BoogieIcfgContainer [2022-03-15 19:09:46,540 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 19:09:46,541 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 19:09:46,541 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 19:09:46,543 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 19:09:46,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 07:09:45" (1/3) ... [2022-03-15 19:09:46,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c488f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:09:46, skipping insertion in model container [2022-03-15 19:09:46,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:09:46" (2/3) ... [2022-03-15 19:09:46,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c488f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:09:46, skipping insertion in model container [2022-03-15 19:09:46,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:09:46" (3/3) ... [2022-03-15 19:09:46,545 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-channel-sum.wvr.c [2022-03-15 19:09:46,548 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 19:09:46,548 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 19:09:46,548 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 19:09:46,548 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 19:09:46,574 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,574 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,575 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,575 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,575 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,575 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,575 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,575 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,576 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,576 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,576 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,576 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,576 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,576 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,577 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,577 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,577 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,577 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,577 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,577 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,577 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,577 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,578 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,578 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,578 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,578 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,578 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,578 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,578 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,579 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,579 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,579 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,579 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,579 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,579 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,579 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,580 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~flag~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,580 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~flag~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,580 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,580 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,580 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,581 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,581 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,581 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,581 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,581 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,581 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,581 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,581 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,582 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,582 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,582 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,582 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,582 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,582 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~flag~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,583 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~flag~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,583 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~flag~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,583 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~flag~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,583 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,583 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,583 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,584 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,584 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,584 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,584 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,584 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,584 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,584 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,584 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,585 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,585 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,585 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,585 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,585 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,585 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~flag~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,585 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~flag~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,586 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~flag~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,586 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~flag~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,591 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,591 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,591 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,591 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,592 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,592 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,592 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,593 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,593 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,593 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,593 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,593 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~flag~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,593 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,593 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,593 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,593 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,593 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:09:46,596 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 19:09:46,623 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 19:09:46,628 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, 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=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 19:09:46,628 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-03-15 19:09:46,636 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 19:09:46,642 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 142 transitions, 300 flow [2022-03-15 19:09:46,644 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 142 transitions, 300 flow [2022-03-15 19:09:46,645 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 138 places, 142 transitions, 300 flow [2022-03-15 19:09:46,688 INFO L129 PetriNetUnfolder]: 11/140 cut-off events. [2022-03-15 19:09:46,688 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-03-15 19:09:46,691 INFO L84 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 140 events. 11/140 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 127 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2022-03-15 19:09:46,693 INFO L116 LiptonReduction]: Number of co-enabled transitions 1292 [2022-03-15 19:09:50,315 INFO L131 LiptonReduction]: Checked pairs total: 1382 [2022-03-15 19:09:50,316 INFO L133 LiptonReduction]: Total number of compositions: 145 [2022-03-15 19:09:50,321 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 25 places, 21 transitions, 58 flow [2022-03-15 19:09:50,339 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 43 states, 42 states have (on average 2.238095238095238) internal successors, (94), 42 states have internal predecessors, (94), 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) [2022-03-15 19:09:50,340 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 42 states have (on average 2.238095238095238) internal successors, (94), 42 states have internal predecessors, (94), 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) [2022-03-15 19:09:50,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 19:09:50,346 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:09:50,347 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:09:50,347 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:09:50,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:09:50,351 INFO L85 PathProgramCache]: Analyzing trace with hash 203435071, now seen corresponding path program 1 times [2022-03-15 19:09:50,363 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:09:50,364 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161835377] [2022-03-15 19:09:50,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:09:50,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:09:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:09:50,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:09:50,530 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:09:50,531 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161835377] [2022-03-15 19:09:50,531 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161835377] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:09:50,531 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:09:50,531 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 19:09:50,532 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1567228830] [2022-03-15 19:09:50,533 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:09:50,536 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:09:50,548 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 58 transitions. [2022-03-15 19:09:50,548 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:09:50,755 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:09:50,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 19:09:50,756 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:09:50,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 19:09:50,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:09:50,771 INFO L87 Difference]: Start difference. First operand has 43 states, 42 states have (on average 2.238095238095238) internal successors, (94), 42 states have internal predecessors, (94), 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) Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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) [2022-03-15 19:09:50,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:09:50,799 INFO L93 Difference]: Finished difference Result 74 states and 164 transitions. [2022-03-15 19:09:50,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:09:50,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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) Word has length 14 [2022-03-15 19:09:50,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:09:50,805 INFO L225 Difference]: With dead ends: 74 [2022-03-15 19:09:50,805 INFO L226 Difference]: Without dead ends: 59 [2022-03-15 19:09:50,806 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:09:50,808 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 3 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:09:50,809 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 3 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:09:50,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-03-15 19:09:50,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2022-03-15 19:09:50,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 2.26) internal successors, (113), 50 states have internal predecessors, (113), 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) [2022-03-15 19:09:50,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 113 transitions. [2022-03-15 19:09:50,832 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 113 transitions. Word has length 14 [2022-03-15 19:09:50,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:09:50,832 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 113 transitions. [2022-03-15 19:09:50,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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) [2022-03-15 19:09:50,832 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 113 transitions. [2022-03-15 19:09:50,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 19:09:50,833 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:09:50,833 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:09:50,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 19:09:50,833 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:09:50,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:09:50,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1448431265, now seen corresponding path program 1 times [2022-03-15 19:09:50,834 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:09:50,835 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952135574] [2022-03-15 19:09:50,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:09:50,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:09:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:09:50,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:09:50,919 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:09:50,920 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952135574] [2022-03-15 19:09:50,920 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952135574] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:09:50,920 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:09:50,920 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:09:50,920 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [640083488] [2022-03-15 19:09:50,920 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:09:50,922 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:09:50,925 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 60 transitions. [2022-03-15 19:09:50,925 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:09:51,067 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [411#(< ~front~0 ~back~0), 410#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)))] [2022-03-15 19:09:51,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 19:09:51,068 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:09:51,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 19:09:51,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-15 19:09:51,069 INFO L87 Difference]: Start difference. First operand 51 states and 113 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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) [2022-03-15 19:09:51,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:09:51,119 INFO L93 Difference]: Finished difference Result 45 states and 94 transitions. [2022-03-15 19:09:51,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:09:51,119 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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) Word has length 16 [2022-03-15 19:09:51,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:09:51,120 INFO L225 Difference]: With dead ends: 45 [2022-03-15 19:09:51,120 INFO L226 Difference]: Without dead ends: 41 [2022-03-15 19:09:51,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-15 19:09:51,121 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 13 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:09:51,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 7 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:09:51,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-03-15 19:09:51,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-03-15 19:09:51,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 2.15) internal successors, (86), 40 states have internal predecessors, (86), 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) [2022-03-15 19:09:51,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 86 transitions. [2022-03-15 19:09:51,125 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 86 transitions. Word has length 16 [2022-03-15 19:09:51,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:09:51,125 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 86 transitions. [2022-03-15 19:09:51,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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) [2022-03-15 19:09:51,125 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 86 transitions. [2022-03-15 19:09:51,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 19:09:51,126 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:09:51,126 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:09:51,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 19:09:51,126 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:09:51,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:09:51,126 INFO L85 PathProgramCache]: Analyzing trace with hash 985849837, now seen corresponding path program 1 times [2022-03-15 19:09:51,127 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:09:51,127 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906129962] [2022-03-15 19:09:51,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:09:51,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:09:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:09:51,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:09:51,173 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:09:51,174 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906129962] [2022-03-15 19:09:51,174 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906129962] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:09:51,174 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:09:51,174 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:09:51,174 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [411662755] [2022-03-15 19:09:51,174 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:09:51,176 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:09:51,182 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 71 transitions. [2022-03-15 19:09:51,182 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:09:51,279 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:09:51,285 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:09:51,414 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:09:51,420 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:09:51,462 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:09:51,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 19:09:51,462 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:09:51,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 19:09:51,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:09:51,463 INFO L87 Difference]: Start difference. First operand 41 states and 86 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2022-03-15 19:09:51,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:09:51,496 INFO L93 Difference]: Finished difference Result 55 states and 107 transitions. [2022-03-15 19:09:51,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:09:51,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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) Word has length 17 [2022-03-15 19:09:51,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:09:51,500 INFO L225 Difference]: With dead ends: 55 [2022-03-15 19:09:51,500 INFO L226 Difference]: Without dead ends: 42 [2022-03-15 19:09:51,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:09:51,502 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 7 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:09:51,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 6 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:09:51,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-03-15 19:09:51,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-03-15 19:09:51,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 41 states have internal predecessors, (87), 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) [2022-03-15 19:09:51,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 87 transitions. [2022-03-15 19:09:51,516 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 87 transitions. Word has length 17 [2022-03-15 19:09:51,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:09:51,516 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 87 transitions. [2022-03-15 19:09:51,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2022-03-15 19:09:51,516 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 87 transitions. [2022-03-15 19:09:51,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 19:09:51,517 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:09:51,517 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:09:51,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 19:09:51,517 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:09:51,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:09:51,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1560879266, now seen corresponding path program 1 times [2022-03-15 19:09:51,518 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:09:51,520 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531310542] [2022-03-15 19:09:51,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:09:51,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:09:51,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:09:51,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:09:51,646 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:09:51,646 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531310542] [2022-03-15 19:09:51,647 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531310542] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:09:51,647 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:09:51,647 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 19:09:51,649 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [8178629] [2022-03-15 19:09:51,649 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:09:51,651 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:09:51,659 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 72 transitions. [2022-03-15 19:09:51,659 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:09:51,874 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:09:51,881 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:09:52,013 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:09:52,023 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:09:52,131 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:09:52,196 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [691#(or (< (+ ~front~0 1) ~back~0) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (< ~front~0 0)), 690#(< ~front~0 ~back~0), 695#(or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (< ~front~0 0)), 692#(or (< ~back~0 0) (< ~front~0 (+ ~back~0 1))), 689#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))), 694#(< ~back~0 0), 693#(or (< ~back~0 0) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (< ~front~0 ~back~0))] [2022-03-15 19:09:52,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 19:09:52,197 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:09:52,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 19:09:52,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-03-15 19:09:52,197 INFO L87 Difference]: Start difference. First operand 42 states and 87 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 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) [2022-03-15 19:09:52,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:09:52,399 INFO L93 Difference]: Finished difference Result 84 states and 183 transitions. [2022-03-15 19:09:52,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 19:09:52,400 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 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) Word has length 18 [2022-03-15 19:09:52,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:09:52,401 INFO L225 Difference]: With dead ends: 84 [2022-03-15 19:09:52,401 INFO L226 Difference]: Without dead ends: 74 [2022-03-15 19:09:52,401 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2022-03-15 19:09:52,401 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 61 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:09:52,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 10 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:09:52,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-03-15 19:09:52,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 52. [2022-03-15 19:09:52,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 2.2941176470588234) internal successors, (117), 51 states have internal predecessors, (117), 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) [2022-03-15 19:09:52,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 117 transitions. [2022-03-15 19:09:52,405 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 117 transitions. Word has length 18 [2022-03-15 19:09:52,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:09:52,405 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 117 transitions. [2022-03-15 19:09:52,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 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) [2022-03-15 19:09:52,405 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 117 transitions. [2022-03-15 19:09:52,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 19:09:52,406 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:09:52,406 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:09:52,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 19:09:52,406 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:09:52,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:09:52,406 INFO L85 PathProgramCache]: Analyzing trace with hash -841668338, now seen corresponding path program 2 times [2022-03-15 19:09:52,407 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:09:52,407 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484540487] [2022-03-15 19:09:52,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:09:52,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:09:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:09:52,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:09:52,773 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:09:52,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484540487] [2022-03-15 19:09:52,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484540487] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:09:52,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215760266] [2022-03-15 19:09:52,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:09:52,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:09:52,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:09:52,775 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) [2022-03-15 19:09:52,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 19:09:52,849 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:09:52,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:09:52,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 19:09:52,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:09:52,935 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-03-15 19:09:52,971 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-03-15 19:09:52,999 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-03-15 19:09:53,114 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-15 19:09:53,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:09:53,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:09:53,686 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:09:53,686 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 96 treesize of output 72 [2022-03-15 19:09:53,697 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:09:53,705 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 232 treesize of output 224 [2022-03-15 19:09:53,715 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:09:53,715 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 208 treesize of output 188 [2022-03-15 19:09:53,725 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:09:53,725 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 172 treesize of output 170 [2022-03-15 19:09:54,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:09:54,121 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215760266] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:09:54,121 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:09:54,121 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2022-03-15 19:09:54,121 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [762021497] [2022-03-15 19:09:54,121 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:09:54,123 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:09:54,128 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 56 transitions. [2022-03-15 19:09:54,128 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:09:54,847 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [1034#(and (or (= ~sum~0 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0)) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~n~0 ~front~0) (< ~front~0 0))), 1035#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0))), 1032#(and (<= (+ ~sum~0 ~element~0) 1) (<= 1 (+ ~sum~0 ~element~0))), 1036#(and (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0))), 1033#(and (or (<= ~n~0 ~front~0) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0)) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~n~0 ~front~0) (< ~front~0 0)))] [2022-03-15 19:09:54,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:09:54,847 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:09:54,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:09:54,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=764, Unknown=1, NotChecked=0, Total=930 [2022-03-15 19:09:54,848 INFO L87 Difference]: Start difference. First operand 52 states and 117 transitions. Second operand has 15 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 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) [2022-03-15 19:09:55,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:09:55,223 INFO L93 Difference]: Finished difference Result 121 states and 281 transitions. [2022-03-15 19:09:55,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 19:09:55,224 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 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) Word has length 18 [2022-03-15 19:09:55,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:09:55,225 INFO L225 Difference]: With dead ends: 121 [2022-03-15 19:09:55,225 INFO L226 Difference]: Without dead ends: 112 [2022-03-15 19:09:55,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=219, Invalid=970, Unknown=1, NotChecked=0, Total=1190 [2022-03-15 19:09:55,226 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 33 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:09:55,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 9 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:09:55,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-03-15 19:09:55,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 68. [2022-03-15 19:09:55,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 2.2686567164179103) internal successors, (152), 67 states have internal predecessors, (152), 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) [2022-03-15 19:09:55,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 152 transitions. [2022-03-15 19:09:55,229 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 152 transitions. Word has length 18 [2022-03-15 19:09:55,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:09:55,230 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 152 transitions. [2022-03-15 19:09:55,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 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) [2022-03-15 19:09:55,230 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 152 transitions. [2022-03-15 19:09:55,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:09:55,231 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:09:55,231 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:09:55,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 19:09:55,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:09:55,441 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:09:55,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:09:55,442 INFO L85 PathProgramCache]: Analyzing trace with hash -195625223, now seen corresponding path program 3 times [2022-03-15 19:09:55,443 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:09:55,443 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689664235] [2022-03-15 19:09:55,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:09:55,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:09:55,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:09:55,787 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:09:55,787 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:09:55,787 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689664235] [2022-03-15 19:09:55,787 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689664235] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:09:55,788 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003256866] [2022-03-15 19:09:55,788 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:09:55,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:09:55,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:09:55,789 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) [2022-03-15 19:09:55,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 19:09:55,858 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:09:55,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:09:55,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 19:09:55,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:09:55,963 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-15 19:09:55,993 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:09:55,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:09:56,144 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:09:56,145 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 176 treesize of output 144 [2022-03-15 19:09:56,542 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:09:56,542 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003256866] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:09:56,542 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:09:56,542 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 19 [2022-03-15 19:09:56,542 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1655890942] [2022-03-15 19:09:56,543 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:09:56,545 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:09:56,550 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 57 transitions. [2022-03-15 19:09:56,550 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:09:57,197 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [1434#(and (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= ~sum~0 0) (<= ~n~0 ~front~0) (< ~front~0 0))), 1431#(and (or (<= ~n~0 ~front~0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0)) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~n~0 ~front~0) (< ~front~0 0))), 1433#(and (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0))), 1432#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0))), 1393#(and (<= (+ ~sum~0 ~element~0) 1) (<= 0 (+ ~sum~0 ~element~0)))] [2022-03-15 19:09:57,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:09:57,197 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:09:57,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:09:57,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2022-03-15 19:09:57,198 INFO L87 Difference]: Start difference. First operand 68 states and 152 transitions. Second operand has 15 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 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) [2022-03-15 19:09:57,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:09:57,699 INFO L93 Difference]: Finished difference Result 145 states and 336 transitions. [2022-03-15 19:09:57,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 19:09:57,700 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 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) Word has length 19 [2022-03-15 19:09:57,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:09:57,701 INFO L225 Difference]: With dead ends: 145 [2022-03-15 19:09:57,701 INFO L226 Difference]: Without dead ends: 136 [2022-03-15 19:09:57,701 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=219, Invalid=903, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:09:57,702 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 82 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:09:57,702 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 8 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:09:57,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-03-15 19:09:57,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 69. [2022-03-15 19:09:57,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 2.264705882352941) internal successors, (154), 68 states have internal predecessors, (154), 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) [2022-03-15 19:09:57,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 154 transitions. [2022-03-15 19:09:57,707 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 154 transitions. Word has length 19 [2022-03-15 19:09:57,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:09:57,708 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 154 transitions. [2022-03-15 19:09:57,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 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) [2022-03-15 19:09:57,708 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 154 transitions. [2022-03-15 19:09:57,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:09:57,708 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:09:57,708 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:09:57,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 19:09:57,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-03-15 19:09:57,927 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:09:57,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:09:57,927 INFO L85 PathProgramCache]: Analyzing trace with hash -780010768, now seen corresponding path program 4 times [2022-03-15 19:09:57,928 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:09:57,928 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013803653] [2022-03-15 19:09:57,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:09:57,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:09:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:09:57,971 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:09:57,972 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:09:57,972 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013803653] [2022-03-15 19:09:57,972 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013803653] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:09:57,972 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:09:57,972 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 19:09:57,972 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [398824586] [2022-03-15 19:09:57,972 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:09:57,980 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:09:57,986 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 72 transitions. [2022-03-15 19:09:57,986 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:09:58,422 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:09:58,433 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:09:58,498 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [1747#(or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~back~0 (+ ~front~0 1)) (< ~front~0 0)), 1741#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))), 1743#(or (< (+ ~front~0 1) ~back~0) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (< ~front~0 0)), 1748#(or (<= ~back~0 (+ ~front~0 1)) (< ~front~0 0)), 1745#(or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (< (+ 2 ~front~0) ~back~0) (<= ~back~0 (+ ~front~0 1)) (< ~front~0 0)), 1746#(or (< (+ 2 ~front~0) ~back~0) (<= ~back~0 (+ ~front~0 1)) (< ~front~0 0)), 1744#(or (< (+ ~front~0 1) ~back~0) (not (< ~front~0 ~back~0)) (< ~front~0 0)), 1742#(< ~front~0 ~back~0)] [2022-03-15 19:09:58,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:09:58,498 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:09:58,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:09:58,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-03-15 19:09:58,499 INFO L87 Difference]: Start difference. First operand 69 states and 154 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 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) [2022-03-15 19:09:58,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:09:58,634 INFO L93 Difference]: Finished difference Result 141 states and 304 transitions. [2022-03-15 19:09:58,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 19:09:58,635 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 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) Word has length 20 [2022-03-15 19:09:58,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:09:58,635 INFO L225 Difference]: With dead ends: 141 [2022-03-15 19:09:58,635 INFO L226 Difference]: Without dead ends: 123 [2022-03-15 19:09:58,635 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-03-15 19:09:58,636 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 60 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:09:58,636 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 4 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:09:58,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-03-15 19:09:58,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 95. [2022-03-15 19:09:58,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 2.3085106382978724) internal successors, (217), 94 states have internal predecessors, (217), 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) [2022-03-15 19:09:58,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 217 transitions. [2022-03-15 19:09:58,640 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 217 transitions. Word has length 20 [2022-03-15 19:09:58,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:09:58,640 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 217 transitions. [2022-03-15 19:09:58,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 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) [2022-03-15 19:09:58,640 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 217 transitions. [2022-03-15 19:09:58,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:09:58,641 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:09:58,641 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:09:58,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 19:09:58,641 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:09:58,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:09:58,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1643125138, now seen corresponding path program 5 times [2022-03-15 19:09:58,659 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:09:58,659 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449313070] [2022-03-15 19:09:58,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:09:58,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:09:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:09:59,011 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:09:59,011 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:09:59,012 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449313070] [2022-03-15 19:09:59,012 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449313070] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:09:59,012 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146370873] [2022-03-15 19:09:59,012 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:09:59,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:09:59,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:09:59,013 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) [2022-03-15 19:09:59,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 19:09:59,079 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:09:59,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:09:59,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 19:09:59,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:09:59,200 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-15 19:09:59,230 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:09:59,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:09:59,417 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:09:59,417 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 178 treesize of output 146 [2022-03-15 19:09:59,799 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:09:59,799 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146370873] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:09:59,799 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:09:59,799 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 20 [2022-03-15 19:09:59,799 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1591357144] [2022-03-15 19:09:59,799 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:09:59,801 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:09:59,806 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 58 transitions. [2022-03-15 19:09:59,806 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:10:00,409 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [2228#(and (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0))), 2227#(and (or (= ~sum~0 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0)) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~n~0 ~front~0) (< ~front~0 0))), 2225#(and (or (<= ~n~0 ~front~0) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0)) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~n~0 ~front~0) (< ~front~0 0))), 2224#(and (<= (+ ~sum~0 ~element~0) 1) (<= 1 (+ ~sum~0 ~element~0))), 2226#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0)))] [2022-03-15 19:10:00,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:10:00,410 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:10:00,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:10:00,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2022-03-15 19:10:00,410 INFO L87 Difference]: Start difference. First operand 95 states and 217 transitions. Second operand has 16 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 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) [2022-03-15 19:10:00,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:10:00,865 INFO L93 Difference]: Finished difference Result 203 states and 470 transitions. [2022-03-15 19:10:00,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 19:10:00,865 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 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) Word has length 20 [2022-03-15 19:10:00,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:10:00,867 INFO L225 Difference]: With dead ends: 203 [2022-03-15 19:10:00,867 INFO L226 Difference]: Without dead ends: 184 [2022-03-15 19:10:00,867 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=190, Invalid=932, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:10:00,868 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 59 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:10:00,868 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 11 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:10:00,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-03-15 19:10:00,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 96. [2022-03-15 19:10:00,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 2.305263157894737) internal successors, (219), 95 states have internal predecessors, (219), 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) [2022-03-15 19:10:00,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 219 transitions. [2022-03-15 19:10:00,872 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 219 transitions. Word has length 20 [2022-03-15 19:10:00,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:10:00,872 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 219 transitions. [2022-03-15 19:10:00,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 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) [2022-03-15 19:10:00,872 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 219 transitions. [2022-03-15 19:10:00,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:10:00,873 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:10:00,873 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:10:00,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 19:10:01,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:10:01,083 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:10:01,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:10:01,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1794784852, now seen corresponding path program 6 times [2022-03-15 19:10:01,084 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:10:01,085 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322291102] [2022-03-15 19:10:01,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:01,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:10:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:01,122 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:10:01,123 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:10:01,123 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322291102] [2022-03-15 19:10:01,123 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322291102] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:10:01,123 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371144755] [2022-03-15 19:10:01,123 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:10:01,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:10:01,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:10:01,124 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) [2022-03-15 19:10:01,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 19:10:01,189 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-15 19:10:01,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:10:01,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 19:10:01,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:10:01,405 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:10:01,406 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 194 treesize of output 144 [2022-03-15 19:10:01,432 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:10:01,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:10:01,571 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-03-15 19:10:01,571 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 201 treesize of output 153 [2022-03-15 19:10:01,701 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:10:01,701 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371144755] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:10:01,701 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:10:01,701 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 14 [2022-03-15 19:10:01,701 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1762148009] [2022-03-15 19:10:01,701 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:10:01,703 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:10:01,709 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 75 transitions. [2022-03-15 19:10:01,710 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:10:01,829 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:10:01,835 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:10:01,950 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:10:01,961 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:10:02,047 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:10:02,053 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:10:02,114 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [2774#(or (< ~back~0 0) (<= ~n~0 ~back~0)), 2773#(<= ~n~0 0), 2775#(or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)))] [2022-03-15 19:10:02,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 19:10:02,114 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:10:02,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 19:10:02,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-03-15 19:10:02,115 INFO L87 Difference]: Start difference. First operand 96 states and 219 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 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) [2022-03-15 19:10:02,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:10:02,174 INFO L93 Difference]: Finished difference Result 109 states and 235 transitions. [2022-03-15 19:10:02,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:10:02,175 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 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) Word has length 21 [2022-03-15 19:10:02,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:10:02,175 INFO L225 Difference]: With dead ends: 109 [2022-03-15 19:10:02,175 INFO L226 Difference]: Without dead ends: 96 [2022-03-15 19:10:02,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2022-03-15 19:10:02,176 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 18 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:10:02,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 8 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:10:02,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-03-15 19:10:02,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-03-15 19:10:02,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 2.294736842105263) internal successors, (218), 95 states have internal predecessors, (218), 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) [2022-03-15 19:10:02,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 218 transitions. [2022-03-15 19:10:02,179 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 218 transitions. Word has length 21 [2022-03-15 19:10:02,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:10:02,179 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 218 transitions. [2022-03-15 19:10:02,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 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) [2022-03-15 19:10:02,179 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 218 transitions. [2022-03-15 19:10:02,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:10:02,180 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:10:02,180 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:10:02,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 19:10:02,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:10:02,397 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:10:02,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:10:02,398 INFO L85 PathProgramCache]: Analyzing trace with hash 729017753, now seen corresponding path program 7 times [2022-03-15 19:10:02,399 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:10:02,399 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279207776] [2022-03-15 19:10:02,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:02,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:10:02,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:02,864 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:10:02,864 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:10:02,864 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279207776] [2022-03-15 19:10:02,864 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279207776] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:10:02,864 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926622753] [2022-03-15 19:10:02,864 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:10:02,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:10:02,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:10:02,868 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) [2022-03-15 19:10:02,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 19:10:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:02,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-15 19:10:02,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:10:03,113 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-15 19:10:03,142 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:10:03,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:10:03,374 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:10:03,375 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 178 treesize of output 146 [2022-03-15 19:10:03,737 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:10:03,737 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926622753] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:10:03,737 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:10:03,737 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 6] total 24 [2022-03-15 19:10:03,737 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [91890294] [2022-03-15 19:10:03,737 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:10:03,739 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:10:03,744 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 59 transitions. [2022-03-15 19:10:03,745 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:10:04,428 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [3231#(and (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0))), 3229#(and (or (= ~sum~0 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0)) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~n~0 ~front~0) (< ~front~0 0))), 3227#(and (<= (+ ~sum~0 ~element~0) 1) (<= 1 (+ ~sum~0 ~element~0))), 3230#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0))), 3228#(and (or (<= ~n~0 ~front~0) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0)) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~n~0 ~front~0) (< ~front~0 0)))] [2022-03-15 19:10:04,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:10:04,428 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:10:04,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:10:04,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=769, Unknown=0, NotChecked=0, Total=930 [2022-03-15 19:10:04,429 INFO L87 Difference]: Start difference. First operand 96 states and 218 transitions. Second operand has 18 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 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) [2022-03-15 19:10:04,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:10:04,918 INFO L93 Difference]: Finished difference Result 188 states and 440 transitions. [2022-03-15 19:10:04,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 19:10:04,918 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 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) Word has length 21 [2022-03-15 19:10:04,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:10:04,919 INFO L225 Difference]: With dead ends: 188 [2022-03-15 19:10:04,919 INFO L226 Difference]: Without dead ends: 169 [2022-03-15 19:10:04,920 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=278, Invalid=1204, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 19:10:04,920 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 64 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:10:04,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 10 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:10:04,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-03-15 19:10:04,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 79. [2022-03-15 19:10:04,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 2.371794871794872) internal successors, (185), 78 states have internal predecessors, (185), 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) [2022-03-15 19:10:04,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 185 transitions. [2022-03-15 19:10:04,923 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 185 transitions. Word has length 21 [2022-03-15 19:10:04,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:10:04,924 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 185 transitions. [2022-03-15 19:10:04,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 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) [2022-03-15 19:10:04,924 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 185 transitions. [2022-03-15 19:10:04,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:10:04,924 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:10:04,924 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:10:04,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 19:10:05,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-15 19:10:05,131 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:10:05,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:10:05,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1978196855, now seen corresponding path program 8 times [2022-03-15 19:10:05,132 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:10:05,133 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127492209] [2022-03-15 19:10:05,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:05,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:10:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:05,676 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:10:05,676 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:10:05,676 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127492209] [2022-03-15 19:10:05,676 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127492209] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:10:05,676 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137712620] [2022-03-15 19:10:05,676 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:10:05,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:10:05,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:10:05,680 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) [2022-03-15 19:10:05,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 19:10:05,743 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:10:05,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:10:05,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 48 conjunts are in the unsatisfiable core [2022-03-15 19:10:05,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:10:06,126 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 19:10:06,127 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 55 treesize of output 19 [2022-03-15 19:10:06,215 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:10:06,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:10:06,694 INFO L353 Elim1Store]: treesize reduction 59, result has 41.0 percent of original size [2022-03-15 19:10:06,695 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 244 treesize of output 202 [2022-03-15 19:10:07,254 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:10:07,255 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137712620] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:10:07,255 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:10:07,255 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 36 [2022-03-15 19:10:07,255 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [777428498] [2022-03-15 19:10:07,255 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:10:07,257 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:10:07,264 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 76 transitions. [2022-03-15 19:10:07,264 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:10:09,335 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [3766#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0))), 3759#(and (or (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 0) (< ~front~0 0))), 3762#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0))), 3761#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 0) (< ~front~0 0)) (or (< ~back~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 0) (< ~front~0 0))), 3760#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (< ~front~0 0))), 3765#(and (or (<= ~n~0 ~front~0) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (= ~sum~0 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 ~front~0) (< ~front~0 0))), 3764#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0))), 3758#(and (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0))), 3763#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (< ~front~0 0)))] [2022-03-15 19:10:09,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:10:09,336 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:10:09,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:10:09,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=1877, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 19:10:09,337 INFO L87 Difference]: Start difference. First operand 79 states and 185 transitions. Second operand has 23 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 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) [2022-03-15 19:10:10,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:10:10,540 INFO L93 Difference]: Finished difference Result 206 states and 490 transitions. [2022-03-15 19:10:10,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 19:10:10,540 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 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) Word has length 22 [2022-03-15 19:10:10,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:10:10,541 INFO L225 Difference]: With dead ends: 206 [2022-03-15 19:10:10,541 INFO L226 Difference]: Without dead ends: 187 [2022-03-15 19:10:10,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=455, Invalid=2737, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 19:10:10,542 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 88 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:10:10,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 9 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:10:10,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-03-15 19:10:10,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 109. [2022-03-15 19:10:10,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 2.3055555555555554) internal successors, (249), 108 states have internal predecessors, (249), 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) [2022-03-15 19:10:10,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 249 transitions. [2022-03-15 19:10:10,545 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 249 transitions. Word has length 22 [2022-03-15 19:10:10,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:10:10,546 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 249 transitions. [2022-03-15 19:10:10,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 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) [2022-03-15 19:10:10,546 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 249 transitions. [2022-03-15 19:10:10,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:10:10,546 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:10:10,546 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:10:10,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 19:10:10,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:10:10,763 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:10:10,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:10:10,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1318454516, now seen corresponding path program 9 times [2022-03-15 19:10:10,765 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:10:10,765 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445240865] [2022-03-15 19:10:10,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:10,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:10:10,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:11,644 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:10:11,644 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:10:11,644 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445240865] [2022-03-15 19:10:11,644 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445240865] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:10:11,644 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748903144] [2022-03-15 19:10:11,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:10:11,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:10:11,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:10:11,646 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) [2022-03-15 19:10:11,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 19:10:11,889 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:10:11,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:10:11,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 19:10:11,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:10:12,150 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 19:10:12,150 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 55 treesize of output 19 [2022-03-15 19:10:12,240 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:10:12,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:10:12,716 INFO L353 Elim1Store]: treesize reduction 59, result has 41.0 percent of original size [2022-03-15 19:10:12,717 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 250 treesize of output 208 [2022-03-15 19:10:13,269 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:10:13,269 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748903144] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:10:13,269 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:10:13,269 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 31 [2022-03-15 19:10:13,269 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [398803994] [2022-03-15 19:10:13,270 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:10:13,272 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:10:13,280 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 77 transitions. [2022-03-15 19:10:13,280 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:10:15,715 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [4385#(and (or (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= 1 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= ~sum~0 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= ~n~0 ~front~0) (< ~front~0 0))), 4383#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (< ~front~0 0))), 4382#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0))), 4377#(and (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0))), 4381#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (< ~front~0 0))), 4380#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~element~0 1) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~element~0 1) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 1 ~element~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 1 ~element~0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0))), 4379#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 0) (< ~front~0 0)) (or (< ~back~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 0) (< ~front~0 0))), 4384#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0))), 4378#(and (or (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 0) (< ~front~0 0))), 4376#(and (<= (+ ~sum~0 ~element~0) 0) (<= 0 (+ ~sum~0 ~element~0)))] [2022-03-15 19:10:15,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 19:10:15,716 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:10:15,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 19:10:15,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1564, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 19:10:15,717 INFO L87 Difference]: Start difference. First operand 109 states and 249 transitions. Second operand has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 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) [2022-03-15 19:10:17,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:10:17,506 INFO L93 Difference]: Finished difference Result 248 states and 592 transitions. [2022-03-15 19:10:17,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 19:10:17,507 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 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) Word has length 23 [2022-03-15 19:10:17,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:10:17,508 INFO L225 Difference]: With dead ends: 248 [2022-03-15 19:10:17,508 INFO L226 Difference]: Without dead ends: 229 [2022-03-15 19:10:17,508 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=453, Invalid=2739, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 19:10:17,509 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 116 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:10:17,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 10 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:10:17,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-03-15 19:10:17,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 127. [2022-03-15 19:10:17,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 2.3095238095238093) internal successors, (291), 126 states have internal predecessors, (291), 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) [2022-03-15 19:10:17,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 291 transitions. [2022-03-15 19:10:17,515 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 291 transitions. Word has length 23 [2022-03-15 19:10:17,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:10:17,515 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 291 transitions. [2022-03-15 19:10:17,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 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) [2022-03-15 19:10:17,515 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 291 transitions. [2022-03-15 19:10:17,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:10:17,516 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:10:17,516 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:10:17,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 19:10:17,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:10:17,727 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:10:17,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:10:17,728 INFO L85 PathProgramCache]: Analyzing trace with hash -2062222421, now seen corresponding path program 10 times [2022-03-15 19:10:17,728 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:10:17,729 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124281397] [2022-03-15 19:10:17,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:17,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:10:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:17,817 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:10:17,817 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:10:17,817 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124281397] [2022-03-15 19:10:17,817 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124281397] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:10:17,817 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481666031] [2022-03-15 19:10:17,817 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:10:17,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:10:17,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:10:17,818 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) [2022-03-15 19:10:17,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 19:10:17,887 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:10:17,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:10:17,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:10:17,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:10:17,946 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 19:10:17,946 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 9 [2022-03-15 19:10:18,001 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:10:18,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:10:18,240 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-03-15 19:10:18,240 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 211 treesize of output 163 [2022-03-15 19:10:18,331 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:10:18,332 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481666031] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:10:18,332 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:10:18,332 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 9] total 17 [2022-03-15 19:10:18,332 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1565063654] [2022-03-15 19:10:18,332 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:10:18,335 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:10:18,363 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 92 transitions. [2022-03-15 19:10:18,363 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:10:18,797 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:10:18,805 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:10:19,120 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:10:19,128 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:10:19,248 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:10:19,264 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:10:19,275 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [5050#(or (< ~back~0 0) (<= ~back~0 ~front~0)), 5074#(or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (< (+ 2 ~front~0) ~back~0) (<= ~back~0 (+ ~front~0 1)) (< ~front~0 0)), 5020#(< ~front~0 ~back~0), 5016#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 5073#(or (< (+ ~front~0 1) ~back~0) (not (< ~front~0 ~back~0)) (< ~front~0 0)), 5072#(or (< (+ ~front~0 1) ~back~0) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (< ~front~0 0)), 5076#(or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (< (+ 3 ~front~0) ~back~0) (<= ~back~0 (+ 2 ~front~0)) (< ~front~0 0)), 5077#(or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~back~0 (+ 2 ~front~0)) (< ~front~0 0)), 5075#(or (< (+ 2 ~front~0) ~back~0) (<= ~back~0 (+ ~front~0 1)) (< ~front~0 0))] [2022-03-15 19:10:19,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:10:19,276 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:10:19,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:10:19,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=402, Unknown=0, NotChecked=0, Total=552 [2022-03-15 19:10:19,276 INFO L87 Difference]: Start difference. First operand 127 states and 291 transitions. Second operand has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 16 states have internal predecessors, (60), 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) [2022-03-15 19:10:19,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:10:19,497 INFO L93 Difference]: Finished difference Result 279 states and 644 transitions. [2022-03-15 19:10:19,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 19:10:19,497 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 16 states have internal predecessors, (60), 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) Word has length 24 [2022-03-15 19:10:19,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:10:19,500 INFO L225 Difference]: With dead ends: 279 [2022-03-15 19:10:19,500 INFO L226 Difference]: Without dead ends: 253 [2022-03-15 19:10:19,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 52 SyntacticMatches, 10 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=232, Invalid=698, Unknown=0, NotChecked=0, Total=930 [2022-03-15 19:10:19,505 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 114 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:10:19,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 4 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:10:19,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-03-15 19:10:19,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 173. [2022-03-15 19:10:19,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 172 states have (on average 2.4069767441860463) internal successors, (414), 172 states have internal predecessors, (414), 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) [2022-03-15 19:10:19,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 414 transitions. [2022-03-15 19:10:19,515 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 414 transitions. Word has length 24 [2022-03-15 19:10:19,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:10:19,515 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 414 transitions. [2022-03-15 19:10:19,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 16 states have internal predecessors, (60), 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) [2022-03-15 19:10:19,516 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 414 transitions. [2022-03-15 19:10:19,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:10:19,518 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:10:19,518 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:10:19,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 19:10:19,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 19:10:19,734 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:10:19,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:10:19,735 INFO L85 PathProgramCache]: Analyzing trace with hash 435431913, now seen corresponding path program 11 times [2022-03-15 19:10:19,735 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:10:19,736 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598948616] [2022-03-15 19:10:19,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:19,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:10:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:20,629 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:10:20,630 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:10:20,630 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598948616] [2022-03-15 19:10:20,630 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598948616] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:10:20,630 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898561039] [2022-03-15 19:10:20,631 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:10:20,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:10:20,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:10:20,632 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) [2022-03-15 19:10:20,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 19:10:20,704 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:10:20,705 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:10:20,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 19:10:20,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:10:21,027 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 19:10:21,027 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 15 [2022-03-15 19:10:21,093 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:10:21,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:10:21,494 INFO L353 Elim1Store]: treesize reduction 59, result has 41.0 percent of original size [2022-03-15 19:10:21,494 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 248 treesize of output 206 [2022-03-15 19:10:22,061 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:10:22,062 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898561039] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:10:22,062 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:10:22,062 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 9] total 34 [2022-03-15 19:10:22,063 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1089959909] [2022-03-15 19:10:22,063 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:10:22,066 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:10:22,075 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 78 transitions. [2022-03-15 19:10:22,075 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:10:24,297 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [5899#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0))), 5893#(and (or (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (< ~front~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 1))), 5892#(and (or (<= ~n~0 ~front~0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0)) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~n~0 ~front~0) (< ~front~0 0))), 5900#(and (or (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 2) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< 0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= ~sum~0 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= ~n~0 ~front~0) (< ~front~0 0))), 5897#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (< ~front~0 0))), 5898#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< 0 ~element~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (< 0 ~element~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~element~0 2) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~element~0 2) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0))), 5891#(and (<= (+ ~sum~0 ~element~0) 1) (<= 0 (+ ~sum~0 ~element~0))), 5895#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 1)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 1)) (or (< ~back~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0))), 5896#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0))), 5894#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (< ~front~0 0)))] [2022-03-15 19:10:24,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 19:10:24,297 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:10:24,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 19:10:24,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=1778, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 19:10:24,298 INFO L87 Difference]: Start difference. First operand 173 states and 414 transitions. Second operand has 25 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 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) [2022-03-15 19:10:25,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:10:25,845 INFO L93 Difference]: Finished difference Result 398 states and 988 transitions. [2022-03-15 19:10:25,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 19:10:25,846 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 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) Word has length 24 [2022-03-15 19:10:25,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:10:25,847 INFO L225 Difference]: With dead ends: 398 [2022-03-15 19:10:25,847 INFO L226 Difference]: Without dead ends: 373 [2022-03-15 19:10:25,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=612, Invalid=3678, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 19:10:25,848 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 144 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:10:25,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 10 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:10:25,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2022-03-15 19:10:25,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 174. [2022-03-15 19:10:25,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 173 states have (on average 2.4046242774566475) internal successors, (416), 173 states have internal predecessors, (416), 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) [2022-03-15 19:10:25,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 416 transitions. [2022-03-15 19:10:25,853 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 416 transitions. Word has length 24 [2022-03-15 19:10:25,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:10:25,853 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 416 transitions. [2022-03-15 19:10:25,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 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) [2022-03-15 19:10:25,854 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 416 transitions. [2022-03-15 19:10:25,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:10:25,854 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:10:25,854 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:10:25,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 19:10:26,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 19:10:26,071 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:10:26,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:10:26,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1504187433, now seen corresponding path program 12 times [2022-03-15 19:10:26,072 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:10:26,072 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008771659] [2022-03-15 19:10:26,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:26,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:10:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:26,141 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:10:26,141 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:10:26,141 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008771659] [2022-03-15 19:10:26,141 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008771659] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:10:26,141 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079096148] [2022-03-15 19:10:26,141 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:10:26,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:10:26,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:10:26,143 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) [2022-03-15 19:10:26,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 19:10:26,216 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:10:26,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:10:26,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 19:10:26,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:10:26,321 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:10:26,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:10:26,420 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:10:26,420 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079096148] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:10:26,420 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:10:26,420 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2022-03-15 19:10:26,421 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [534252808] [2022-03-15 19:10:26,421 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:10:26,424 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:10:26,435 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 100 transitions. [2022-03-15 19:10:26,435 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:10:26,598 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:10:26,605 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:10:26,702 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:10:26,714 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:10:26,807 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:10:26,817 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:10:26,940 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:10:26,947 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:10:27,124 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:10:27,135 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:10:27,184 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [6850#(<= ~n~0 0), 6851#(or (< ~back~0 0) (<= ~n~0 ~back~0)), 6852#(or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1))), 6853#(or (< ~back~0 0) (<= ~n~0 (+ ~back~0 2)))] [2022-03-15 19:10:27,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:10:27,184 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:10:27,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:10:27,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2022-03-15 19:10:27,185 INFO L87 Difference]: Start difference. First operand 174 states and 416 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 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) [2022-03-15 19:10:27,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:10:27,266 INFO L93 Difference]: Finished difference Result 184 states and 429 transitions. [2022-03-15 19:10:27,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 19:10:27,267 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 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) Word has length 25 [2022-03-15 19:10:27,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:10:27,267 INFO L225 Difference]: With dead ends: 184 [2022-03-15 19:10:27,267 INFO L226 Difference]: Without dead ends: 157 [2022-03-15 19:10:27,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=546, Unknown=0, NotChecked=0, Total=702 [2022-03-15 19:10:27,268 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 28 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:10:27,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 6 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:10:27,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-03-15 19:10:27,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-03-15 19:10:27,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 2.480769230769231) internal successors, (387), 156 states have internal predecessors, (387), 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) [2022-03-15 19:10:27,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 387 transitions. [2022-03-15 19:10:27,274 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 387 transitions. Word has length 25 [2022-03-15 19:10:27,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:10:27,274 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 387 transitions. [2022-03-15 19:10:27,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 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) [2022-03-15 19:10:27,274 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 387 transitions. [2022-03-15 19:10:27,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:10:27,275 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:10:27,275 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:10:27,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 19:10:27,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 19:10:27,487 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:10:27,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:10:27,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1168465004, now seen corresponding path program 13 times [2022-03-15 19:10:27,488 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:10:27,488 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091785050] [2022-03-15 19:10:27,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:27,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:10:27,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:30,631 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:10:30,632 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:10:30,632 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091785050] [2022-03-15 19:10:30,632 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091785050] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:10:30,632 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037789637] [2022-03-15 19:10:30,632 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:10:30,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:10:30,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:10:30,633 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) [2022-03-15 19:10:30,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 19:10:30,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:30,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 50 conjunts are in the unsatisfiable core [2022-03-15 19:10:30,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:10:31,057 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 19:10:31,058 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 15 [2022-03-15 19:10:31,135 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:10:31,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:10:31,624 INFO L353 Elim1Store]: treesize reduction 59, result has 41.0 percent of original size [2022-03-15 19:10:31,625 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 244 treesize of output 202 [2022-03-15 19:10:32,192 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:10:32,192 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037789637] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:10:32,192 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:10:32,192 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 9] total 36 [2022-03-15 19:10:32,192 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2147096785] [2022-03-15 19:10:32,192 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:10:32,195 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:10:32,204 INFO L252 McrAutomatonBuilder]: Finished intersection with 50 states and 79 transitions. [2022-03-15 19:10:32,205 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:10:34,426 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [7544#(and (or (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 0) (< ~front~0 0))), 7542#(and (<= (+ ~sum~0 ~element~0) 0) (<= 0 (+ ~sum~0 ~element~0))), 7547#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0))), 7548#(and (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= ~sum~0 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= ~n~0 ~front~0) (< ~front~0 0))), 7545#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 0) (< ~front~0 0)) (or (< ~back~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 0) (< ~front~0 0))), 7543#(and (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0))), 7549#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 ~front~0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= 1 ~front~0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~element~0 1) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= ~element~0 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0))), 7551#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0))), 7550#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (< ~front~0 0))), 7546#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (< ~front~0 0)))] [2022-03-15 19:10:34,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:10:34,427 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:10:34,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:10:34,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=1953, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 19:10:34,428 INFO L87 Difference]: Start difference. First operand 157 states and 387 transitions. Second operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 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) [2022-03-15 19:10:36,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:10:36,065 INFO L93 Difference]: Finished difference Result 389 states and 970 transitions. [2022-03-15 19:10:36,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 19:10:36,066 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 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) Word has length 25 [2022-03-15 19:10:36,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:10:36,067 INFO L225 Difference]: With dead ends: 389 [2022-03-15 19:10:36,067 INFO L226 Difference]: Without dead ends: 364 [2022-03-15 19:10:36,068 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 32 SyntacticMatches, 8 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1102 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=585, Invalid=3575, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 19:10:36,069 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 112 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:10:36,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 23 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:10:36,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-03-15 19:10:36,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 158. [2022-03-15 19:10:36,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 2.477707006369427) internal successors, (389), 157 states have internal predecessors, (389), 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) [2022-03-15 19:10:36,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 389 transitions. [2022-03-15 19:10:36,073 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 389 transitions. Word has length 25 [2022-03-15 19:10:36,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:10:36,074 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 389 transitions. [2022-03-15 19:10:36,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 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) [2022-03-15 19:10:36,074 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 389 transitions. [2022-03-15 19:10:36,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:10:36,074 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:10:36,074 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:10:36,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 19:10:36,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-15 19:10:36,293 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:10:36,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:10:36,293 INFO L85 PathProgramCache]: Analyzing trace with hash 951082546, now seen corresponding path program 14 times [2022-03-15 19:10:36,296 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:10:36,296 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229851762] [2022-03-15 19:10:36,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:36,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:10:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:36,908 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:10:36,908 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:10:36,908 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229851762] [2022-03-15 19:10:36,908 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229851762] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:10:36,908 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855964969] [2022-03-15 19:10:36,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:10:36,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:10:36,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:10:36,909 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) [2022-03-15 19:10:36,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 19:10:36,986 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:10:36,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:10:36,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 66 conjunts are in the unsatisfiable core [2022-03-15 19:10:36,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:10:37,095 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-03-15 19:10:37,135 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-03-15 19:10:37,171 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-03-15 19:10:37,645 INFO L353 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2022-03-15 19:10:37,646 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 74 treesize of output 20 [2022-03-15 19:10:37,742 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:10:37,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:10:38,914 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:10:38,914 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 270 treesize of output 174 [2022-03-15 19:10:38,966 INFO L353 Elim1Store]: treesize reduction 182, result has 30.3 percent of original size [2022-03-15 19:10:38,967 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 522 treesize of output 522 [2022-03-15 19:10:39,027 INFO L353 Elim1Store]: treesize reduction 182, result has 30.3 percent of original size [2022-03-15 19:10:39,027 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 444 treesize of output 402 [2022-03-15 19:10:39,086 INFO L353 Elim1Store]: treesize reduction 182, result has 30.3 percent of original size [2022-03-15 19:10:39,086 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 324 treesize of output 342 [2022-03-15 19:10:45,678 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:10:45,678 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855964969] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:10:45,679 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:10:45,679 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 51 [2022-03-15 19:10:45,679 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [226720364] [2022-03-15 19:10:45,679 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:10:45,682 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:10:45,694 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 101 transitions. [2022-03-15 19:10:45,694 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:10:50,306 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [8504#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))))), 8503#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 8508#(and (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1) 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= ~sum~0 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (< ~front~0 0))), 8502#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0))), 8494#(and (<= (+ ~sum~0 ~element~0) 1) (<= 0 (+ ~sum~0 ~element~0))), 8506#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~element~0 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~element~0 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)))), 8507#(and (or (< ~back~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))))), 8495#(and (or (<= ~n~0 ~front~0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0)) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~n~0 ~front~0) (< ~front~0 0))), 8496#(and (or (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (< ~front~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 1))), 8500#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= ~n~0 ~back~0) (< ~front~0 0))), 8497#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (< ~front~0 0))), 8505#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 8498#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (< ~front~0 0))), 8501#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~element~0 1) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= ~element~0 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (<= ~n~0 ~back~0))), 8499#(and (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))))] [2022-03-15 19:10:50,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 19:10:50,307 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:10:50,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 19:10:50,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=493, Invalid=4062, Unknown=1, NotChecked=0, Total=4556 [2022-03-15 19:10:50,308 INFO L87 Difference]: Start difference. First operand 158 states and 389 transitions. Second operand has 33 states, 32 states have (on average 2.21875) internal successors, (71), 32 states have internal predecessors, (71), 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) [2022-03-15 19:10:54,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:10:54,887 INFO L93 Difference]: Finished difference Result 477 states and 1185 transitions. [2022-03-15 19:10:54,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 19:10:54,890 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.21875) internal successors, (71), 32 states have internal predecessors, (71), 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) Word has length 26 [2022-03-15 19:10:54,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:10:54,892 INFO L225 Difference]: With dead ends: 477 [2022-03-15 19:10:54,892 INFO L226 Difference]: Without dead ends: 445 [2022-03-15 19:10:54,893 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2482 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=1088, Invalid=8031, Unknown=1, NotChecked=0, Total=9120 [2022-03-15 19:10:54,894 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 204 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 1077 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 1207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:10:54,894 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 14 Invalid, 1207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1077 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:10:54,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2022-03-15 19:10:54,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 223. [2022-03-15 19:10:54,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 2.490990990990991) internal successors, (553), 222 states have internal predecessors, (553), 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) [2022-03-15 19:10:54,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 553 transitions. [2022-03-15 19:10:54,899 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 553 transitions. Word has length 26 [2022-03-15 19:10:54,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:10:54,900 INFO L470 AbstractCegarLoop]: Abstraction has 223 states and 553 transitions. [2022-03-15 19:10:54,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.21875) internal successors, (71), 32 states have internal predecessors, (71), 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) [2022-03-15 19:10:54,900 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 553 transitions. [2022-03-15 19:10:54,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:10:54,900 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:10:54,900 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:10:54,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 19:10:55,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-15 19:10:55,116 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:10:55,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:10:55,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1231013490, now seen corresponding path program 15 times [2022-03-15 19:10:55,116 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:10:55,117 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772071705] [2022-03-15 19:10:55,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:10:55,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:10:55,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:10:55,908 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:10:55,908 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:10:55,908 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772071705] [2022-03-15 19:10:55,908 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772071705] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:10:55,908 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608233869] [2022-03-15 19:10:55,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:10:55,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:10:55,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:10:55,909 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) [2022-03-15 19:10:55,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 19:10:55,993 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:10:55,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:10:55,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 75 conjunts are in the unsatisfiable core [2022-03-15 19:10:56,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:10:56,125 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-03-15 19:10:56,171 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-03-15 19:10:56,212 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-03-15 19:10:56,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:10:56,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:10:56,731 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:10:56,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:10:56,735 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:10:56,735 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 23 [2022-03-15 19:10:56,825 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:10:56,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:10:59,293 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:10:59,293 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 270 treesize of output 174 [2022-03-15 19:10:59,341 INFO L353 Elim1Store]: treesize reduction 213, result has 16.8 percent of original size [2022-03-15 19:10:59,341 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 520 treesize of output 486 [2022-03-15 19:10:59,395 INFO L353 Elim1Store]: treesize reduction 213, result has 16.8 percent of original size [2022-03-15 19:10:59,395 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 444 treesize of output 370 [2022-03-15 19:10:59,448 INFO L353 Elim1Store]: treesize reduction 213, result has 16.8 percent of original size [2022-03-15 19:10:59,448 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 328 treesize of output 312 [2022-03-15 19:10:59,460 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-03-15 19:11:01,496 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:11:01,496 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608233869] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:11:01,496 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:11:01,496 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 49 [2022-03-15 19:11:01,496 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1306627429] [2022-03-15 19:11:01,497 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:11:01,500 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:11:01,511 INFO L252 McrAutomatonBuilder]: Finished intersection with 56 states and 91 transitions. [2022-03-15 19:11:01,511 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:11:05,967 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [9701#(and (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= 1 ~sum~0) (< ~front~0 0)) (or (<= ~sum~0 1) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (<= ~n~0 ~front~0) (< ~front~0 0))), 9692#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 1)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 1)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0))), 9695#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= ~n~0 ~back~0) (< ~front~0 0))), 9696#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (< ~front~0 0))), 9698#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 9700#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 9697#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 1 ~element~0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~element~0 1) (<= ~n~0 ~back~0)) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (* ~n~0 4) (+ (* ~back~0 4) 8)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0))), 9689#(and (<= (+ ~sum~0 ~element~0) 1) (<= 1 (+ ~sum~0 ~element~0))), 9691#(and (or (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (< ~front~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 1))), 9693#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (< ~front~0 0))), 9699#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 9703#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~sum~0 1) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~sum~0 1) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (= (+ ~element~0 1) 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= 1 ~sum~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (+ ~element~0 1) 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= 1 ~sum~0))), 9702#(and (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 9690#(and (or (<= ~n~0 ~front~0) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0)) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~n~0 ~front~0) (< ~front~0 0))), 9694#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (< ~front~0 0)))] [2022-03-15 19:11:05,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 19:11:05,968 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:11:05,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 19:11:05,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=598, Invalid=3691, Unknown=1, NotChecked=0, Total=4290 [2022-03-15 19:11:05,969 INFO L87 Difference]: Start difference. First operand 223 states and 553 transitions. Second operand has 33 states, 32 states have (on average 2.09375) internal successors, (67), 32 states have internal predecessors, (67), 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) [2022-03-15 19:11:15,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:11:15,321 INFO L93 Difference]: Finished difference Result 905 states and 2052 transitions. [2022-03-15 19:11:15,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-03-15 19:11:15,321 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.09375) internal successors, (67), 32 states have internal predecessors, (67), 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) Word has length 26 [2022-03-15 19:11:15,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:11:15,323 INFO L225 Difference]: With dead ends: 905 [2022-03-15 19:11:15,323 INFO L226 Difference]: Without dead ends: 591 [2022-03-15 19:11:15,326 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4652 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=2120, Invalid=13379, Unknown=1, NotChecked=0, Total=15500 [2022-03-15 19:11:15,326 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 511 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 2207 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 2447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 2207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:11:15,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [511 Valid, 14 Invalid, 2447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 2207 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 19:11:15,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2022-03-15 19:11:15,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 279. [2022-03-15 19:11:15,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 278 states have (on average 2.579136690647482) internal successors, (717), 278 states have internal predecessors, (717), 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) [2022-03-15 19:11:15,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 717 transitions. [2022-03-15 19:11:15,334 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 717 transitions. Word has length 26 [2022-03-15 19:11:15,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:11:15,334 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 717 transitions. [2022-03-15 19:11:15,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.09375) internal successors, (67), 32 states have internal predecessors, (67), 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) [2022-03-15 19:11:15,334 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 717 transitions. [2022-03-15 19:11:15,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:11:15,335 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:11:15,335 INFO L514 BasicCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:11:15,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 19:11:15,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 19:11:15,535 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:11:15,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:11:15,536 INFO L85 PathProgramCache]: Analyzing trace with hash 650338121, now seen corresponding path program 16 times [2022-03-15 19:11:15,536 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:11:15,536 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327071435] [2022-03-15 19:11:15,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:11:15,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:11:15,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:11:16,813 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:11:16,813 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:11:16,813 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327071435] [2022-03-15 19:11:16,813 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327071435] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:11:16,813 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763449462] [2022-03-15 19:11:16,814 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:11:16,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:11:16,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:11:16,815 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:11:16,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 19:11:16,893 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:11:16,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:11:16,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 19:11:16,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:11:17,209 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 19:11:17,209 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 15 [2022-03-15 19:11:17,275 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:11:17,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:11:17,707 INFO L353 Elim1Store]: treesize reduction 59, result has 41.0 percent of original size [2022-03-15 19:11:17,707 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 258 treesize of output 216 [2022-03-15 19:11:18,078 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 19:11:18,078 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763449462] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:11:18,078 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:11:18,078 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 8] total 36 [2022-03-15 19:11:18,078 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [413998899] [2022-03-15 19:11:18,078 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:11:18,081 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:11:18,091 INFO L252 McrAutomatonBuilder]: Finished intersection with 51 states and 80 transitions. [2022-03-15 19:11:18,092 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:11:20,199 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [11473#(and (<= (+ ~sum~0 ~element~0) 0) (<= 0 (+ ~sum~0 ~element~0))), 11475#(and (or (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 0) (< ~front~0 0))), 11477#(and (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= ~sum~0 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= ~n~0 ~front~0) (< ~front~0 0))), 11481#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (< ~front~0 0))), 11482#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0))), 11480#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0))), 11476#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (< ~front~0 0))), 11478#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 0) (< ~front~0 0)) (or (< ~back~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 0) (< ~front~0 0))), 11474#(and (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0))), 11479#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~element~0 1) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= ~element~0 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)))] [2022-03-15 19:11:20,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 19:11:20,200 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:11:20,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 19:11:20,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=1898, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 19:11:20,200 INFO L87 Difference]: Start difference. First operand 279 states and 717 transitions. Second operand has 27 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 26 states have internal predecessors, (56), 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) [2022-03-15 19:11:21,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:11:21,299 INFO L93 Difference]: Finished difference Result 503 states and 1281 transitions. [2022-03-15 19:11:21,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 19:11:21,299 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 26 states have internal predecessors, (56), 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) Word has length 26 [2022-03-15 19:11:21,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:11:21,301 INFO L225 Difference]: With dead ends: 503 [2022-03-15 19:11:21,301 INFO L226 Difference]: Without dead ends: 478 [2022-03-15 19:11:21,301 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 941 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=627, Invalid=3155, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 19:11:21,302 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 91 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:11:21,302 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 11 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:11:21,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2022-03-15 19:11:21,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 260. [2022-03-15 19:11:21,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 259 states have (on average 2.6216216216216215) internal successors, (679), 259 states have internal predecessors, (679), 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) [2022-03-15 19:11:21,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 679 transitions. [2022-03-15 19:11:21,308 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 679 transitions. Word has length 26 [2022-03-15 19:11:21,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:11:21,308 INFO L470 AbstractCegarLoop]: Abstraction has 260 states and 679 transitions. [2022-03-15 19:11:21,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 26 states have internal predecessors, (56), 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) [2022-03-15 19:11:21,308 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 679 transitions. [2022-03-15 19:11:21,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:11:21,309 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:11:21,309 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:11:21,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-03-15 19:11:21,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:11:21,523 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:11:21,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:11:21,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1499404573, now seen corresponding path program 17 times [2022-03-15 19:11:21,524 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:11:21,524 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287832718] [2022-03-15 19:11:21,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:11:21,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:11:21,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:11:23,116 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:11:23,117 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:11:23,117 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287832718] [2022-03-15 19:11:23,117 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287832718] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:11:23,117 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287858360] [2022-03-15 19:11:23,117 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:11:23,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:11:23,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:11:23,118 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:11:23,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 19:11:23,202 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:11:23,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:11:23,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 50 conjunts are in the unsatisfiable core [2022-03-15 19:11:23,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:11:23,700 INFO L353 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-03-15 19:11:23,700 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 72 treesize of output 20 [2022-03-15 19:11:23,752 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:11:23,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:11:24,607 INFO L353 Elim1Store]: treesize reduction 173, result has 32.4 percent of original size [2022-03-15 19:11:24,608 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 308 treesize of output 272 [2022-03-15 19:11:25,159 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:11:25,159 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287858360] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:11:25,159 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:11:25,159 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 12] total 43 [2022-03-15 19:11:25,160 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1777563669] [2022-03-15 19:11:25,160 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:11:25,163 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:11:25,176 INFO L252 McrAutomatonBuilder]: Finished intersection with 61 states and 102 transitions. [2022-03-15 19:11:25,176 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:11:29,699 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [12739#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= ~n~0 ~back~0) (< ~front~0 0))), 12742#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= 1 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~element~0 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~element~0 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)))), 12744#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 12740#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4))) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~element~0 1) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= ~element~0 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= 1 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4))) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0))), 12743#(and (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 12738#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (< ~front~0 0))), 12747#(and (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 12741#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (< ~front~0 0))), 12737#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (< ~front~0 0))), 12748#(and (or (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= 1 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= ~sum~0 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= ~n~0 ~front~0) (< ~front~0 0))), 12745#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 12736#(and (or (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (< ~front~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 1))), 12746#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 12735#(and (or (<= ~n~0 ~front~0) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0)) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~n~0 ~front~0) (< ~front~0 0)))] [2022-03-15 19:11:29,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 19:11:29,700 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:11:29,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 19:11:29,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=3038, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 19:11:29,701 INFO L87 Difference]: Start difference. First operand 260 states and 679 transitions. Second operand has 33 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 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) [2022-03-15 19:11:31,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:11:31,319 INFO L93 Difference]: Finished difference Result 491 states and 1264 transitions. [2022-03-15 19:11:31,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 19:11:31,320 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 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) Word has length 27 [2022-03-15 19:11:31,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:11:31,322 INFO L225 Difference]: With dead ends: 491 [2022-03-15 19:11:31,322 INFO L226 Difference]: Without dead ends: 468 [2022-03-15 19:11:31,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1184 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=460, Invalid=3962, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 19:11:31,323 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 74 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:11:31,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 15 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:11:31,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-03-15 19:11:31,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 300. [2022-03-15 19:11:31,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 2.608695652173913) internal successors, (780), 299 states have internal predecessors, (780), 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) [2022-03-15 19:11:31,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 780 transitions. [2022-03-15 19:11:31,329 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 780 transitions. Word has length 27 [2022-03-15 19:11:31,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:11:31,329 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 780 transitions. [2022-03-15 19:11:31,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 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) [2022-03-15 19:11:31,329 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 780 transitions. [2022-03-15 19:11:31,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:11:31,330 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:11:31,330 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:11:31,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-03-15 19:11:31,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:11:31,537 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:11:31,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:11:31,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1779335517, now seen corresponding path program 18 times [2022-03-15 19:11:31,538 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:11:31,538 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138030957] [2022-03-15 19:11:31,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:11:31,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:11:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:11:32,588 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:11:32,588 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:11:32,588 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138030957] [2022-03-15 19:11:32,588 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138030957] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:11:32,589 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058300962] [2022-03-15 19:11:32,589 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:11:32,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:11:32,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:11:32,590 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:11:32,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 19:11:32,675 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:11:32,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:11:32,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 52 conjunts are in the unsatisfiable core [2022-03-15 19:11:32,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:11:33,212 INFO L353 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2022-03-15 19:11:33,213 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 76 treesize of output 22 [2022-03-15 19:11:33,296 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:11:33,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:11:34,187 INFO L353 Elim1Store]: treesize reduction 173, result has 32.4 percent of original size [2022-03-15 19:11:34,187 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 302 treesize of output 266 [2022-03-15 19:11:34,984 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:11:34,984 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058300962] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:11:34,984 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:11:34,984 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 13] total 44 [2022-03-15 19:11:34,984 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1207898030] [2022-03-15 19:11:34,985 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:11:34,988 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:11:35,000 INFO L252 McrAutomatonBuilder]: Finished intersection with 57 states and 92 transitions. [2022-03-15 19:11:35,000 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:11:39,419 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [14068#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 14067#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 14071#(and (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= 1 ~sum~0) (< ~front~0 0)) (or (<= ~sum~0 1) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (<= ~n~0 ~front~0) (< ~front~0 0))), 14060#(and (or (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (< ~front~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 1))), 14058#(and (<= (+ ~sum~0 ~element~0) 1) (<= 1 (+ ~sum~0 ~element~0))), 14065#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (< ~front~0 0))), 14063#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (< ~front~0 0))), 14061#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (< ~front~0 0))), 14064#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= ~n~0 ~back~0) (< ~front~0 0))), 14070#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~sum~0 1) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~sum~0 1) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (= (+ ~element~0 1) 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= 1 ~sum~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (+ ~element~0 1) 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= 1 ~sum~0))), 14062#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 1)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 1)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0))), 14066#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 14059#(and (or (<= ~n~0 ~front~0) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0)) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~n~0 ~front~0) (< ~front~0 0))), 14072#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (* ~n~0 4) (+ (* ~back~0 4) 8)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= 1 ~front~0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< (* ~n~0 4) (+ (* ~back~0 4) 8)) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (* ~n~0 4) (+ (* ~back~0 4) 8)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~front~0 1)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0))), 14069#(and (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)))] [2022-03-15 19:11:39,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 19:11:39,420 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:11:39,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 19:11:39,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=3315, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 19:11:39,420 INFO L87 Difference]: Start difference. First operand 300 states and 780 transitions. Second operand has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 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) [2022-03-15 19:11:41,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:11:41,667 INFO L93 Difference]: Finished difference Result 529 states and 1365 transitions. [2022-03-15 19:11:41,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 19:11:41,668 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 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) Word has length 27 [2022-03-15 19:11:41,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:11:41,670 INFO L225 Difference]: With dead ends: 529 [2022-03-15 19:11:41,670 INFO L226 Difference]: Without dead ends: 508 [2022-03-15 19:11:41,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1381 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=511, Invalid=5341, Unknown=0, NotChecked=0, Total=5852 [2022-03-15 19:11:41,671 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 91 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 1130 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:11:41,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 16 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1130 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:11:41,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2022-03-15 19:11:41,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 300. [2022-03-15 19:11:41,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 2.608695652173913) internal successors, (780), 299 states have internal predecessors, (780), 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) [2022-03-15 19:11:41,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 780 transitions. [2022-03-15 19:11:41,677 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 780 transitions. Word has length 27 [2022-03-15 19:11:41,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:11:41,677 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 780 transitions. [2022-03-15 19:11:41,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 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) [2022-03-15 19:11:41,677 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 780 transitions. [2022-03-15 19:11:41,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:11:41,678 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:11:41,678 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:11:41,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-15 19:11:41,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:11:41,879 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:11:41,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:11:41,879 INFO L85 PathProgramCache]: Analyzing trace with hash -228296940, now seen corresponding path program 19 times [2022-03-15 19:11:41,880 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:11:41,880 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74246789] [2022-03-15 19:11:41,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:11:41,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:11:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:11:41,942 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 19:11:41,943 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:11:41,943 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74246789] [2022-03-15 19:11:41,943 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74246789] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:11:41,943 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416732064] [2022-03-15 19:11:41,943 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:11:41,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:11:41,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:11:41,944 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:11:41,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-15 19:11:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:11:42,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 19:11:42,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:11:42,138 INFO L353 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-03-15 19:11:42,138 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 12 [2022-03-15 19:11:42,214 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:11:42,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:11:42,635 INFO L353 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2022-03-15 19:11:42,635 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 243 treesize of output 177 [2022-03-15 19:11:42,732 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:11:42,732 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416732064] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:11:42,732 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:11:42,732 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 11] total 23 [2022-03-15 19:11:42,732 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [614843662] [2022-03-15 19:11:42,732 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:11:42,736 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:11:42,751 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 117 transitions. [2022-03-15 19:11:42,752 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:11:43,237 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:11:43,245 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:11:43,333 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:11:43,340 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:11:43,452 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:11:43,461 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:11:43,752 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:11:43,761 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:11:43,971 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:11:43,978 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:11:44,040 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [15426#(or (< (+ 3 ~front~0) ~back~0) (<= ~back~0 (+ 2 ~front~0)) (< ~front~0 0)), 15395#(or (< ~back~0 0) (<= ~back~0 ~front~0)), 15423#(or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (< (+ 2 ~front~0) ~back~0) (<= ~back~0 (+ ~front~0 1)) (< ~front~0 0)), 15429#(or (<= ~back~0 (+ 3 ~front~0)) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (< ~front~0 0)), 15421#(or (< (+ ~front~0 1) ~back~0) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (< ~front~0 0)), 15422#(or (< (+ ~front~0 1) ~back~0) (not (< ~front~0 ~back~0)) (< ~front~0 0)), 15420#(< ~front~0 ~back~0), 15425#(or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (< (+ 3 ~front~0) ~back~0) (<= ~back~0 (+ 2 ~front~0)) (< ~front~0 0)), 15350#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 15424#(or (< (+ 2 ~front~0) ~back~0) (<= ~back~0 (+ ~front~0 1)) (< ~front~0 0)), 15428#(or (<= ~back~0 (+ 3 ~front~0)) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (< (+ ~front~0 4) ~back~0) (< ~front~0 0)), 15427#(or (< ~back~0 0) (<= ~back~0 (+ ~front~0 1)))] [2022-03-15 19:11:44,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:11:44,041 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:11:44,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:11:44,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:11:44,041 INFO L87 Difference]: Start difference. First operand 300 states and 780 transitions. Second operand has 19 states, 19 states have (on average 3.789473684210526) internal successors, (72), 18 states have internal predecessors, (72), 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) [2022-03-15 19:11:44,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:11:44,302 INFO L93 Difference]: Finished difference Result 532 states and 1344 transitions. [2022-03-15 19:11:44,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 19:11:44,302 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.789473684210526) internal successors, (72), 18 states have internal predecessors, (72), 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) Word has length 28 [2022-03-15 19:11:44,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:11:44,304 INFO L225 Difference]: With dead ends: 532 [2022-03-15 19:11:44,304 INFO L226 Difference]: Without dead ends: 464 [2022-03-15 19:11:44,304 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 61 SyntacticMatches, 9 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 821 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=421, Invalid=1301, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 19:11:44,304 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 135 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:11:44,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 4 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:11:44,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2022-03-15 19:11:44,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 332. [2022-03-15 19:11:44,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 2.6706948640483383) internal successors, (884), 331 states have internal predecessors, (884), 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) [2022-03-15 19:11:44,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 884 transitions. [2022-03-15 19:11:44,311 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 884 transitions. Word has length 28 [2022-03-15 19:11:44,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:11:44,311 INFO L470 AbstractCegarLoop]: Abstraction has 332 states and 884 transitions. [2022-03-15 19:11:44,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.789473684210526) internal successors, (72), 18 states have internal predecessors, (72), 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) [2022-03-15 19:11:44,311 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 884 transitions. [2022-03-15 19:11:44,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:11:44,312 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:11:44,312 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:11:44,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-15 19:11:44,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:11:44,529 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:11:44,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:11:44,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1317518226, now seen corresponding path program 20 times [2022-03-15 19:11:44,530 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:11:44,530 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421671193] [2022-03-15 19:11:44,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:11:44,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:11:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:11:46,064 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:11:46,064 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:11:46,064 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421671193] [2022-03-15 19:11:46,064 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421671193] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:11:46,064 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044812114] [2022-03-15 19:11:46,064 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:11:46,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:11:46,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:11:46,065 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:11:46,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-15 19:11:46,151 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:11:46,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:11:46,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 59 conjunts are in the unsatisfiable core [2022-03-15 19:11:46,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:11:46,677 INFO L353 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2022-03-15 19:11:46,677 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 76 treesize of output 22 [2022-03-15 19:11:46,764 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:11:46,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:11:47,634 INFO L353 Elim1Store]: treesize reduction 149, result has 41.8 percent of original size [2022-03-15 19:11:47,634 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 314 treesize of output 302 [2022-03-15 19:11:48,545 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:11:48,545 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044812114] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:11:48,545 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:11:48,545 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 12] total 44 [2022-03-15 19:11:48,545 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [365775179] [2022-03-15 19:11:48,546 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:11:48,549 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:11:48,563 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 103 transitions. [2022-03-15 19:11:48,563 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:11:53,159 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [16850#(and (<= (+ ~sum~0 ~element~0) 1) (<= 1 (+ ~sum~0 ~element~0))), 16859#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 16861#(and (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 16857#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 16862#(and (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= ~sum~0 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= ~n~0 ~front~0) (< ~front~0 0))), 16864#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~element~0 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~element~0 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)))), 16858#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (< ~front~0 0))), 16852#(and (or (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (< ~front~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 1))), 16853#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (< ~front~0 0))), 16851#(and (or (<= ~n~0 ~front~0) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0)) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~n~0 ~front~0) (< ~front~0 0))), 16863#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~element~0 1) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= ~element~0 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (<= ~n~0 ~back~0))), 16855#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= ~n~0 ~back~0) (< ~front~0 0))), 16860#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 16856#(and (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 16854#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (< ~front~0 0)))] [2022-03-15 19:11:53,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 19:11:53,160 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:11:53,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 19:11:53,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=3283, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 19:11:53,160 INFO L87 Difference]: Start difference. First operand 332 states and 884 transitions. Second operand has 34 states, 33 states have (on average 2.212121212121212) internal successors, (73), 33 states have internal predecessors, (73), 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) [2022-03-15 19:11:54,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:11:54,284 INFO L93 Difference]: Finished difference Result 677 states and 1802 transitions. [2022-03-15 19:11:54,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 19:11:54,285 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.212121212121212) internal successors, (73), 33 states have internal predecessors, (73), 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) Word has length 28 [2022-03-15 19:11:54,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:11:54,287 INFO L225 Difference]: With dead ends: 677 [2022-03-15 19:11:54,287 INFO L226 Difference]: Without dead ends: 650 [2022-03-15 19:11:54,288 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1196 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=466, Invalid=4364, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 19:11:54,288 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 99 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:11:54,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 15 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:11:54,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2022-03-15 19:11:54,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 356. [2022-03-15 19:11:54,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 355 states have (on average 2.628169014084507) internal successors, (933), 355 states have internal predecessors, (933), 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) [2022-03-15 19:11:54,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 933 transitions. [2022-03-15 19:11:54,296 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 933 transitions. Word has length 28 [2022-03-15 19:11:54,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:11:54,296 INFO L470 AbstractCegarLoop]: Abstraction has 356 states and 933 transitions. [2022-03-15 19:11:54,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.212121212121212) internal successors, (73), 33 states have internal predecessors, (73), 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) [2022-03-15 19:11:54,297 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 933 transitions. [2022-03-15 19:11:54,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:11:54,297 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:11:54,297 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:11:54,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-15 19:11:54,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:11:54,517 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:11:54,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:11:54,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1597449170, now seen corresponding path program 21 times [2022-03-15 19:11:54,518 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:11:54,518 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212502669] [2022-03-15 19:11:54,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:11:54,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:11:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:11:55,539 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:11:55,539 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:11:55,539 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212502669] [2022-03-15 19:11:55,540 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212502669] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:11:55,540 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872857216] [2022-03-15 19:11:55,540 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:11:55,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:11:55,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:11:55,541 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:11:55,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-15 19:11:55,735 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:11:55,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:11:55,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 42 conjunts are in the unsatisfiable core [2022-03-15 19:11:55,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:11:56,178 INFO L353 Elim1Store]: treesize reduction 106, result has 2.8 percent of original size [2022-03-15 19:11:56,178 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 23 [2022-03-15 19:11:56,260 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:11:56,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:11:57,694 INFO L353 Elim1Store]: treesize reduction 206, result has 17.9 percent of original size [2022-03-15 19:11:57,695 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 320 treesize of output 248 [2022-03-15 19:11:58,249 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:11:58,249 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872857216] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:11:58,249 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:11:58,249 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 12] total 40 [2022-03-15 19:11:58,250 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [552972708] [2022-03-15 19:11:58,250 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:11:58,253 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:11:58,266 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 93 transitions. [2022-03-15 19:11:58,267 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:12:02,431 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [18482#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= ~n~0 ~back~0) (< ~front~0 0))), 18476#(and (<= (+ ~sum~0 ~element~0) 1) (<= 1 (+ ~sum~0 ~element~0))), 18489#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~sum~0 1) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~sum~0 1) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (= (+ ~element~0 1) 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= 1 ~sum~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (+ ~element~0 1) 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= 1 ~sum~0))), 18483#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 18490#(and (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= 1 ~sum~0) (< ~front~0 0)) (or (<= ~sum~0 1) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (<= ~n~0 ~front~0) (< ~front~0 0))), 18481#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (< ~front~0 0))), 18478#(and (or (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (< ~front~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 1))), 18484#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (< ~front~0 0))), 18487#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 18479#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (< ~front~0 0))), 18485#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 18488#(and (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 18486#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (= (* ~front~0 4) (* ~back~0 4))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= ~element~0 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0))), 18480#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 1)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 1)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0))), 18477#(and (or (<= ~n~0 ~front~0) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0)) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~n~0 ~front~0) (< ~front~0 0)))] [2022-03-15 19:12:02,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 19:12:02,431 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:12:02,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 19:12:02,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=2824, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 19:12:02,432 INFO L87 Difference]: Start difference. First operand 356 states and 933 transitions. Second operand has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 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) [2022-03-15 19:12:04,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:12:04,520 INFO L93 Difference]: Finished difference Result 729 states and 1908 transitions. [2022-03-15 19:12:04,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-15 19:12:04,521 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 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) Word has length 28 [2022-03-15 19:12:04,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:12:04,523 INFO L225 Difference]: With dead ends: 729 [2022-03-15 19:12:04,523 INFO L226 Difference]: Without dead ends: 708 [2022-03-15 19:12:04,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1203 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=593, Invalid=4809, Unknown=0, NotChecked=0, Total=5402 [2022-03-15 19:12:04,524 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 91 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:12:04,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 16 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:12:04,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2022-03-15 19:12:04,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 333. [2022-03-15 19:12:04,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 2.6686746987951806) internal successors, (886), 332 states have internal predecessors, (886), 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) [2022-03-15 19:12:04,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 886 transitions. [2022-03-15 19:12:04,531 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 886 transitions. Word has length 28 [2022-03-15 19:12:04,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:12:04,531 INFO L470 AbstractCegarLoop]: Abstraction has 333 states and 886 transitions. [2022-03-15 19:12:04,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 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) [2022-03-15 19:12:04,531 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 886 transitions. [2022-03-15 19:12:04,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:12:04,532 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:12:04,532 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:12:04,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-15 19:12:04,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:12:04,748 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:12:04,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:12:04,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1392343950, now seen corresponding path program 22 times [2022-03-15 19:12:04,748 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:12:04,749 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115975546] [2022-03-15 19:12:04,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:12:04,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:12:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:12:04,823 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:12:04,823 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:12:04,823 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115975546] [2022-03-15 19:12:04,824 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115975546] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:12:04,824 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235965227] [2022-03-15 19:12:04,824 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:12:04,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:12:04,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:12:04,825 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:12:04,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-15 19:12:04,914 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:12:04,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:12:04,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 19:12:04,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:12:05,047 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 100 [2022-03-15 19:12:05,184 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:12:05,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:12:05,292 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:12:05,297 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:12:05,412 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 18 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:12:05,412 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235965227] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:12:05,412 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:12:05,412 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 27 [2022-03-15 19:12:05,412 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2125862759] [2022-03-15 19:12:05,412 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:12:05,416 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:12:05,433 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 115 transitions. [2022-03-15 19:12:05,434 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:12:05,574 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:12:05,579 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:12:05,663 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:12:05,669 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:12:05,764 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:12:05,774 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:12:05,866 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:12:05,877 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:12:06,062 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:12:06,069 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:12:06,181 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:12:06,190 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:12:06,287 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:12:06,293 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:12:06,347 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [20121#(or (< ~back~0 0) (<= ~n~0 (+ ~back~0 2))), 20118#(or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1))), 20120#(or (<= ~n~0 0) (<= ~n~0 ~back~0)), 20117#(or (< ~back~0 0) (<= ~n~0 ~back~0)), 20116#(<= ~n~0 0), 20122#(or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3))), 20119#(or (<= ~n~0 (+ ~back~0 1)) (<= ~n~0 0))] [2022-03-15 19:12:06,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:12:06,348 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:12:06,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:12:06,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=951, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 19:12:06,348 INFO L87 Difference]: Start difference. First operand 333 states and 886 transitions. Second operand has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 16 states have internal predecessors, (53), 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) [2022-03-15 19:12:06,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:12:06,441 INFO L93 Difference]: Finished difference Result 271 states and 667 transitions. [2022-03-15 19:12:06,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 19:12:06,441 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 16 states have internal predecessors, (53), 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) Word has length 29 [2022-03-15 19:12:06,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:12:06,442 INFO L225 Difference]: With dead ends: 271 [2022-03-15 19:12:06,442 INFO L226 Difference]: Without dead ends: 246 [2022-03-15 19:12:06,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=285, Invalid=1197, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 19:12:06,442 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 27 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:12:06,443 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 8 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:12:06,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-03-15 19:12:06,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2022-03-15 19:12:06,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 2.5795918367346937) internal successors, (632), 245 states have internal predecessors, (632), 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) [2022-03-15 19:12:06,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 632 transitions. [2022-03-15 19:12:06,446 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 632 transitions. Word has length 29 [2022-03-15 19:12:06,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:12:06,446 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 632 transitions. [2022-03-15 19:12:06,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 16 states have internal predecessors, (53), 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) [2022-03-15 19:12:06,447 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 632 transitions. [2022-03-15 19:12:06,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:12:06,447 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:12:06,447 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:12:06,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-15 19:12:06,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-03-15 19:12:06,655 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:12:06,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:12:06,656 INFO L85 PathProgramCache]: Analyzing trace with hash -25991235, now seen corresponding path program 23 times [2022-03-15 19:12:06,656 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:12:06,657 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953995894] [2022-03-15 19:12:06,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:12:06,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:12:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:12:11,298 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:12:11,299 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:12:11,299 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953995894] [2022-03-15 19:12:11,299 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953995894] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:12:11,299 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631738924] [2022-03-15 19:12:11,299 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:12:11,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:12:11,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:12:11,300 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:12:11,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-15 19:12:11,402 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:12:11,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:12:11,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 56 conjunts are in the unsatisfiable core [2022-03-15 19:12:11,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:12:12,075 INFO L353 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2022-03-15 19:12:12,075 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 76 treesize of output 22 [2022-03-15 19:12:12,176 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:12:12,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:12:13,045 INFO L353 Elim1Store]: treesize reduction 173, result has 32.4 percent of original size [2022-03-15 19:12:13,046 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 302 treesize of output 266 [2022-03-15 19:12:13,948 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 19:12:13,948 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631738924] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:12:13,948 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:12:13,948 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 13] total 48 [2022-03-15 19:12:13,948 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2145246801] [2022-03-15 19:12:13,948 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:12:13,953 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:12:13,984 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 104 transitions. [2022-03-15 19:12:13,984 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:12:18,733 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [21123#(and (or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= 2 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (* (div (+ (* ~front~0 4) 11) 4) 4)))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= ~sum~0 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= ~n~0 ~front~0) (< ~front~0 0))), 21120#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 21115#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (< ~front~0 0))), 21114#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (< ~front~0 0))), 21113#(and (or (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (< ~front~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 1))), 21119#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (< ~front~0 0))), 21124#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) ~element~0) 2) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (<= 2 (+ (select (select |#memory_int| ~queue~0.base) (* (div (+ 7 (* ~front~0 4)) 4) 4)) ~element~0)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (<= 2 (+ (select (select |#memory_int| ~queue~0.base) (* (div (+ 7 (* ~front~0 4)) 4) 4)) ~element~0)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) ~element~0) 2) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0))), 21112#(and (or (<= ~n~0 ~front~0) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0)) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~n~0 ~front~0) (< ~front~0 0))), 21122#(and (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 21117#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= ~n~0 ~back~0) (< ~front~0 0))), 21121#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 21116#(and (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 21118#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 21125#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) ~element~0) 2) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (<= 2 (+ (select (select |#memory_int| ~queue~0.base) (* (div (+ 7 (* ~front~0 4)) 4) 4)) ~element~0)) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= 2 (+ (select (select |#memory_int| ~queue~0.base) (* (div (+ 7 (* ~front~0 4)) 4) 4)) ~element~0)) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) ~element~0) 2)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0)))] [2022-03-15 19:12:18,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 19:12:18,733 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:12:18,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 19:12:18,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=3695, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 19:12:18,734 INFO L87 Difference]: Start difference. First operand 246 states and 632 transitions. Second operand has 34 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 33 states have internal predecessors, (72), 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) [2022-03-15 19:12:21,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:12:21,366 INFO L93 Difference]: Finished difference Result 670 states and 1741 transitions. [2022-03-15 19:12:21,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 19:12:21,366 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 33 states have internal predecessors, (72), 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) Word has length 29 [2022-03-15 19:12:21,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:12:21,368 INFO L225 Difference]: With dead ends: 670 [2022-03-15 19:12:21,368 INFO L226 Difference]: Without dead ends: 637 [2022-03-15 19:12:21,369 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 37 SyntacticMatches, 9 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=504, Invalid=5976, Unknown=0, NotChecked=0, Total=6480 [2022-03-15 19:12:21,369 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 107 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:12:21,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 18 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 988 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:12:21,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2022-03-15 19:12:21,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 270. [2022-03-15 19:12:21,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 269 states have (on average 2.5315985130111525) internal successors, (681), 269 states have internal predecessors, (681), 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) [2022-03-15 19:12:21,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 681 transitions. [2022-03-15 19:12:21,375 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 681 transitions. Word has length 29 [2022-03-15 19:12:21,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:12:21,375 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 681 transitions. [2022-03-15 19:12:21,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 33 states have internal predecessors, (72), 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) [2022-03-15 19:12:21,375 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 681 transitions. [2022-03-15 19:12:21,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:12:21,376 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:12:21,376 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:12:21,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-15 19:12:21,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-03-15 19:12:21,584 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:12:21,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:12:21,585 INFO L85 PathProgramCache]: Analyzing trace with hash 253939709, now seen corresponding path program 24 times [2022-03-15 19:12:21,585 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:12:21,585 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811931447] [2022-03-15 19:12:21,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:12:21,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:12:21,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:12:28,016 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:12:28,017 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:12:28,017 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811931447] [2022-03-15 19:12:28,017 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811931447] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:12:28,017 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099885847] [2022-03-15 19:12:28,017 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:12:28,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:12:28,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:12:28,018 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:12:28,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-15 19:12:28,424 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:12:28,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:12:28,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 85 conjunts are in the unsatisfiable core [2022-03-15 19:12:28,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:12:28,678 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-03-15 19:12:28,728 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-03-15 19:12:28,773 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-03-15 19:12:29,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:12:29,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:12:29,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:12:29,335 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:12:29,335 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 20 [2022-03-15 19:12:29,424 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:12:29,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:12:30,933 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:12:30,933 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 272 treesize of output 176 [2022-03-15 19:12:30,962 INFO L353 Elim1Store]: treesize reduction 248, result has 5.0 percent of original size [2022-03-15 19:12:30,963 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 528 treesize of output 462 [2022-03-15 19:12:30,993 INFO L353 Elim1Store]: treesize reduction 248, result has 5.0 percent of original size [2022-03-15 19:12:30,993 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 450 treesize of output 342 [2022-03-15 19:12:31,023 INFO L353 Elim1Store]: treesize reduction 248, result has 5.0 percent of original size [2022-03-15 19:12:31,023 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 330 treesize of output 282 [2022-03-15 19:12:31,843 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:12:31,844 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099885847] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:12:31,844 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:12:31,844 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 20] total 58 [2022-03-15 19:12:31,844 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2025691297] [2022-03-15 19:12:31,844 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:12:31,848 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:12:31,878 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 94 transitions. [2022-03-15 19:12:31,879 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:12:36,329 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [22610#(and (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 22598#(and (or (<= ~n~0 ~front~0) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0)) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~n~0 ~front~0) (< ~front~0 0))), 22601#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 1)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 1)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0))), 22599#(and (or (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (< ~front~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 1))), 22602#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (< ~front~0 0))), 22607#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 22609#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 22600#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (< ~front~0 0))), 22605#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 22611#(and (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 1 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= ~element~0 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (= (* ~front~0 4) (* ~back~0 4))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< 0 ~element~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (* ~n~0 4) (+ (* ~back~0 4) 8)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= (* ~front~0 4) (* ~back~0 4))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0))), 22603#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= ~n~0 ~back~0) (< ~front~0 0))), 22604#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 2 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (= (+ ~element~0 1) 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (+ ~element~0 1) 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 2 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0))), 22608#(and (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 2) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= 2 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (<= ~n~0 ~front~0) (< ~front~0 0))), 22606#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (< ~front~0 0)))] [2022-03-15 19:12:36,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 19:12:36,329 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:12:36,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 19:12:36,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=4575, Unknown=7, NotChecked=0, Total=5402 [2022-03-15 19:12:36,330 INFO L87 Difference]: Start difference. First operand 270 states and 681 transitions. Second operand has 35 states, 34 states have (on average 2.0) internal successors, (68), 34 states have internal predecessors, (68), 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) [2022-03-15 19:12:39,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:12:39,344 INFO L93 Difference]: Finished difference Result 598 states and 1533 transitions. [2022-03-15 19:12:39,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-15 19:12:39,345 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.0) internal successors, (68), 34 states have internal predecessors, (68), 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) Word has length 29 [2022-03-15 19:12:39,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:12:39,347 INFO L225 Difference]: With dead ends: 598 [2022-03-15 19:12:39,347 INFO L226 Difference]: Without dead ends: 577 [2022-03-15 19:12:39,348 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2767 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1156, Invalid=7579, Unknown=7, NotChecked=0, Total=8742 [2022-03-15 19:12:39,348 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 116 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:12:39,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 13 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 19:12:39,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2022-03-15 19:12:39,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 247. [2022-03-15 19:12:39,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 2.5772357723577235) internal successors, (634), 246 states have internal predecessors, (634), 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) [2022-03-15 19:12:39,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 634 transitions. [2022-03-15 19:12:39,353 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 634 transitions. Word has length 29 [2022-03-15 19:12:39,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:12:39,353 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 634 transitions. [2022-03-15 19:12:39,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.0) internal successors, (68), 34 states have internal predecessors, (68), 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) [2022-03-15 19:12:39,354 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 634 transitions. [2022-03-15 19:12:39,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:12:39,354 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:12:39,354 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:12:39,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-03-15 19:12:39,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-15 19:12:39,571 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:12:39,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:12:39,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1511287277, now seen corresponding path program 25 times [2022-03-15 19:12:39,572 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:12:39,572 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383124] [2022-03-15 19:12:39,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:12:39,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:12:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:12:40,664 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:12:40,665 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:12:40,665 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383124] [2022-03-15 19:12:40,665 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383124] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:12:40,665 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550890438] [2022-03-15 19:12:40,665 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:12:40,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:12:40,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:12:40,666 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:12:40,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-15 19:12:40,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:12:40,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 71 conjunts are in the unsatisfiable core [2022-03-15 19:12:40,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:12:41,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:12:41,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:12:41,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:12:41,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:12:41,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:12:41,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:12:41,727 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:12:41,728 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 26 [2022-03-15 19:12:41,823 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:12:41,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:12:43,096 INFO L353 Elim1Store]: treesize reduction 467, result has 3.5 percent of original size [2022-03-15 19:12:43,096 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 360 treesize of output 222 [2022-03-15 19:12:43,588 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:12:43,589 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550890438] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:12:43,589 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:12:43,589 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 20] total 60 [2022-03-15 19:12:43,589 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1912722839] [2022-03-15 19:12:43,589 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:12:43,593 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:12:43,612 INFO L252 McrAutomatonBuilder]: Finished intersection with 73 states and 126 transitions. [2022-03-15 19:12:43,612 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:12:50,383 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [23996#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)))), 23982#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (< ~front~0 0))), 23991#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 23989#(and (or (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 23987#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 23992#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 23984#(and (or (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 23990#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 23988#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 23995#(and (or (< ~back~0 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0))), 23986#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 23997#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)))), 23993#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~back~0 3)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 23980#(and (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0))), 23981#(and (or (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 0) (< ~front~0 0))), 23994#(and (or (< ~back~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 23983#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~front~0 1)) (< ~front~0 0))), 23985#(and (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 23998#(and (or (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 12)))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= ~sum~0 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 12))) 0) (<= ~n~0 ~front~0) (< ~front~0 0)))] [2022-03-15 19:12:50,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 19:12:50,384 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:12:50,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 19:12:50,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=715, Invalid=5765, Unknown=0, NotChecked=0, Total=6480 [2022-03-15 19:12:50,384 INFO L87 Difference]: Start difference. First operand 247 states and 634 transitions. Second operand has 41 states, 40 states have (on average 2.2) internal successors, (88), 40 states have internal predecessors, (88), 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) [2022-03-15 19:12:55,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:12:55,736 INFO L93 Difference]: Finished difference Result 724 states and 1891 transitions. [2022-03-15 19:12:55,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 19:12:55,736 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.2) internal successors, (88), 40 states have internal predecessors, (88), 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) Word has length 30 [2022-03-15 19:12:55,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:12:55,738 INFO L225 Difference]: With dead ends: 724 [2022-03-15 19:12:55,738 INFO L226 Difference]: Without dead ends: 686 [2022-03-15 19:12:55,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3715 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=1430, Invalid=10780, Unknown=0, NotChecked=0, Total=12210 [2022-03-15 19:12:55,740 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 136 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 1796 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 1865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:12:55,740 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 15 Invalid, 1865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1796 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 19:12:55,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2022-03-15 19:12:55,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 304. [2022-03-15 19:12:55,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 2.547854785478548) internal successors, (772), 303 states have internal predecessors, (772), 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) [2022-03-15 19:12:55,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 772 transitions. [2022-03-15 19:12:55,746 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 772 transitions. Word has length 30 [2022-03-15 19:12:55,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:12:55,746 INFO L470 AbstractCegarLoop]: Abstraction has 304 states and 772 transitions. [2022-03-15 19:12:55,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.2) internal successors, (88), 40 states have internal predecessors, (88), 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) [2022-03-15 19:12:55,746 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 772 transitions. [2022-03-15 19:12:55,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:12:55,747 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:12:55,747 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:12:55,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-03-15 19:12:55,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:12:55,948 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:12:55,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:12:55,948 INFO L85 PathProgramCache]: Analyzing trace with hash -58015187, now seen corresponding path program 26 times [2022-03-15 19:12:55,952 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:12:55,952 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416640891] [2022-03-15 19:12:55,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:12:55,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:12:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:12:56,683 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:12:56,683 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:12:56,683 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416640891] [2022-03-15 19:12:56,683 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416640891] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:12:56,683 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379751187] [2022-03-15 19:12:56,683 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:12:56,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:12:56,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:12:56,685 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:12:56,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-03-15 19:12:56,793 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:12:56,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:12:56,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 74 conjunts are in the unsatisfiable core [2022-03-15 19:12:56,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:12:57,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:12:57,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:12:57,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:12:57,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:12:57,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:12:57,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:12:57,659 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:12:57,660 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 26 [2022-03-15 19:12:57,742 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:12:57,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:12:58,905 INFO L353 Elim1Store]: treesize reduction 309, result has 36.2 percent of original size [2022-03-15 19:12:58,906 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 354 treesize of output 374 [2022-03-15 19:13:00,477 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:13:00,477 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379751187] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:13:00,477 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:13:00,477 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 19] total 57 [2022-03-15 19:13:00,477 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1028903838] [2022-03-15 19:13:00,478 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:13:00,482 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:13:00,499 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 116 transitions. [2022-03-15 19:13:00,499 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:13:07,453 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [25640#(and (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~element~0 1) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (* ~n~0 4) (+ (* ~back~0 4) 8)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (* ~front~0 4) ~queue~0.offset) 4) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4))) (<= ~n~0 ~back~0))), 25627#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~front~0 1)) (< ~front~0 0))), 25638#(and (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= 1 ~sum~0) (< ~front~0 0)) (or (<= ~sum~0 1) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (<= ~n~0 ~front~0) (< ~front~0 0))), 25628#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (< ~front~0 0))), 25629#(and (or (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 25632#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 25634#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 25633#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 25636#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 25639#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~back~0 3)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 25637#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 25630#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 25626#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (< ~front~0 0))), 25641#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (+ (* ~front~0 4) ~queue~0.offset) 4) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (<= (* ~n~0 4) (+ (* ~back~0 4) 12)) (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~element~0 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0))), 25625#(and (or (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 0) (< ~front~0 0))), 25635#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) ~element~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~sum~0 1) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) ~element~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~sum~0 1) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (= (+ ~element~0 1) 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= 1 ~sum~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (+ ~element~0 1) 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= 1 ~sum~0))), 25624#(and (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0))), 25642#(and (or (< ~back~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 25631#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)))] [2022-03-15 19:13:07,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 19:13:07,454 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:13:07,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 19:13:07,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=702, Invalid=5304, Unknown=0, NotChecked=0, Total=6006 [2022-03-15 19:13:07,454 INFO L87 Difference]: Start difference. First operand 304 states and 772 transitions. Second operand has 40 states, 39 states have (on average 2.1538461538461537) internal successors, (84), 39 states have internal predecessors, (84), 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) [2022-03-15 19:13:56,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:13:56,965 INFO L93 Difference]: Finished difference Result 3019 states and 6849 transitions. [2022-03-15 19:13:56,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 230 states. [2022-03-15 19:13:56,965 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.1538461538461537) internal successors, (84), 39 states have internal predecessors, (84), 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) Word has length 30 [2022-03-15 19:13:56,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:13:56,973 INFO L225 Difference]: With dead ends: 3019 [2022-03-15 19:13:56,973 INFO L226 Difference]: Without dead ends: 2386 [2022-03-15 19:13:56,976 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30205 ImplicationChecksByTransitivity, 48.7s TimeCoverageRelationStatistics Valid=11051, Invalid=71031, Unknown=0, NotChecked=0, Total=82082 [2022-03-15 19:13:56,976 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 901 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 4852 mSolverCounterSat, 470 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 5322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 470 IncrementalHoareTripleChecker+Valid, 4852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:13:56,977 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [901 Valid, 12 Invalid, 5322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [470 Valid, 4852 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-03-15 19:13:56,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2386 states. [2022-03-15 19:13:56,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 778. [2022-03-15 19:13:56,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 777 states have (on average 2.888030888030888) internal successors, (2244), 777 states have internal predecessors, (2244), 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) [2022-03-15 19:13:56,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 2244 transitions. [2022-03-15 19:13:56,996 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 2244 transitions. Word has length 30 [2022-03-15 19:13:56,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:13:56,996 INFO L470 AbstractCegarLoop]: Abstraction has 778 states and 2244 transitions. [2022-03-15 19:13:56,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.1538461538461537) internal successors, (84), 39 states have internal predecessors, (84), 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) [2022-03-15 19:13:56,996 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 2244 transitions. [2022-03-15 19:13:56,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:13:56,997 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:13:56,998 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:13:57,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-03-15 19:13:57,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-15 19:13:57,215 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:13:57,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:13:57,215 INFO L85 PathProgramCache]: Analyzing trace with hash 221915757, now seen corresponding path program 27 times [2022-03-15 19:13:57,216 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:13:57,216 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853141280] [2022-03-15 19:13:57,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:13:57,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:13:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:13:58,087 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:13:58,087 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:13:58,087 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853141280] [2022-03-15 19:13:58,087 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853141280] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:13:58,087 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341130837] [2022-03-15 19:13:58,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:13:58,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:13:58,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:13:58,088 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:13:58,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-03-15 19:13:58,289 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 19:13:58,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:13:58,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 79 conjunts are in the unsatisfiable core [2022-03-15 19:13:58,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:13:58,457 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-03-15 19:13:58,498 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-03-15 19:13:58,538 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-03-15 19:13:59,323 INFO L353 Elim1Store]: treesize reduction 258, result has 31.9 percent of original size [2022-03-15 19:13:59,323 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 101 treesize of output 149 [2022-03-15 19:13:59,619 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:13:59,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:14:02,918 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:14:02,918 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 359 treesize of output 227 [2022-03-15 19:14:03,007 INFO L353 Elim1Store]: treesize reduction 417, result has 13.8 percent of original size [2022-03-15 19:14:03,008 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1404 treesize of output 1264 [2022-03-15 19:14:03,103 INFO L353 Elim1Store]: treesize reduction 419, result has 13.4 percent of original size [2022-03-15 19:14:03,103 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1198 treesize of output 1104 [2022-03-15 19:14:03,199 INFO L353 Elim1Store]: treesize reduction 419, result has 13.4 percent of original size [2022-03-15 19:14:03,200 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1040 treesize of output 788 [2022-03-15 19:14:11,404 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:14:11,404 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341130837] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:14:11,404 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:14:11,405 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 21] total 60 [2022-03-15 19:14:11,405 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1042663324] [2022-03-15 19:14:11,405 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:14:11,409 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:14:11,426 INFO L252 McrAutomatonBuilder]: Finished intersection with 65 states and 106 transitions. [2022-03-15 19:14:11,427 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:14:18,650 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [30874#(and (or (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 0) (< ~front~0 0))), 30884#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 30891#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~element~0 1) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 ~sum~0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= ~element~0 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 ~sum~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0))), 30880#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 30889#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2))) (or (<= (* ~n~0 4) (+ (* ~back~0 4) 12)) (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0))), 30890#(and (or (< ~back~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 30885#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 30882#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 30887#(and (or (<= ~sum~0 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= 0 ~sum~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= ~n~0 ~front~0) (< ~front~0 0))), 30886#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~back~0 3)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 30878#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (< ~front~0 0))), 30875#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 0) (< ~front~0 0)) (or (< ~back~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 0) (< ~front~0 0))), 30881#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 30876#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (< ~front~0 0))), 30873#(and (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0))), 30872#(and (<= (+ ~sum~0 ~element~0) 0) (<= 0 (+ ~sum~0 ~element~0))), 30883#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 30879#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 30877#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0))), 30888#(and (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~element~0 1) (<= ~n~0 ~back~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4))) (<= ~n~0 ~back~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (* ~n~0 4) (+ (* ~back~0 4) 8)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))))] [2022-03-15 19:14:18,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 19:14:18,650 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:14:18,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 19:14:18,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=818, Invalid=5818, Unknown=6, NotChecked=0, Total=6642 [2022-03-15 19:14:18,651 INFO L87 Difference]: Start difference. First operand 778 states and 2244 transitions. Second operand has 41 states, 40 states have (on average 2.05) internal successors, (82), 40 states have internal predecessors, (82), 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) [2022-03-15 19:14:31,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:14:31,021 INFO L93 Difference]: Finished difference Result 994 states and 2428 transitions. [2022-03-15 19:14:31,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-03-15 19:14:31,021 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.05) internal successors, (82), 40 states have internal predecessors, (82), 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) Word has length 30 [2022-03-15 19:14:31,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:14:31,024 INFO L225 Difference]: With dead ends: 994 [2022-03-15 19:14:31,024 INFO L226 Difference]: Without dead ends: 832 [2022-03-15 19:14:31,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4278 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=2422, Invalid=15394, Unknown=6, NotChecked=0, Total=17822 [2022-03-15 19:14:31,027 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 493 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 2057 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 2307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 2057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:14:31,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [493 Valid, 12 Invalid, 2307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 2057 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 19:14:31,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2022-03-15 19:14:31,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 414. [2022-03-15 19:14:31,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 413 states have (on average 2.6803874092009687) internal successors, (1107), 413 states have internal predecessors, (1107), 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) [2022-03-15 19:14:31,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 1107 transitions. [2022-03-15 19:14:31,035 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 1107 transitions. Word has length 30 [2022-03-15 19:14:31,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:14:31,035 INFO L470 AbstractCegarLoop]: Abstraction has 414 states and 1107 transitions. [2022-03-15 19:14:31,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.05) internal successors, (82), 40 states have internal predecessors, (82), 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) [2022-03-15 19:14:31,035 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 1107 transitions. [2022-03-15 19:14:31,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:14:31,036 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:14:31,036 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:14:31,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-03-15 19:14:31,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:14:31,242 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:14:31,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:14:31,242 INFO L85 PathProgramCache]: Analyzing trace with hash 46538025, now seen corresponding path program 28 times [2022-03-15 19:14:31,243 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:14:31,243 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961373117] [2022-03-15 19:14:31,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:14:31,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:14:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:14:32,037 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:14:32,038 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:14:32,038 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961373117] [2022-03-15 19:14:32,038 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961373117] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:14:32,038 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260079073] [2022-03-15 19:14:32,038 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:14:32,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:14:32,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:14:32,039 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:14:32,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-03-15 19:14:32,141 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:14:32,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:14:32,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 63 conjunts are in the unsatisfiable core [2022-03-15 19:14:32,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:14:33,143 INFO L353 Elim1Store]: treesize reduction 351, result has 2.8 percent of original size [2022-03-15 19:14:33,144 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 95 treesize of output 35 [2022-03-15 19:14:33,242 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:14:33,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:15:01,245 INFO L353 Elim1Store]: treesize reduction 294, result has 36.5 percent of original size [2022-03-15 19:15:01,245 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 344 treesize of output 364 [2022-03-15 19:15:09,904 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 31 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:15:09,905 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260079073] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:15:09,905 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:15:09,905 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 20] total 59 [2022-03-15 19:15:09,905 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [881007145] [2022-03-15 19:15:09,905 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:15:09,909 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:15:09,928 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 116 transitions. [2022-03-15 19:15:09,928 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:15:55,222 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [33071#(and (or (< ~back~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 33067#(and (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= 1 ~sum~0) (< ~front~0 0)) (or (<= ~sum~0 1) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (<= ~n~0 ~front~0) (< ~front~0 0))), 33054#(and (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0))), 33053#(and (<= (+ ~sum~0 ~element~0) 0) (<= 0 (+ ~sum~0 ~element~0))), 33057#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~front~0 1)) (< ~front~0 0))), 33066#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~sum~0 1) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~sum~0 1) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (= (+ ~element~0 1) 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= 1 ~sum~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (+ ~element~0 1) 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= 1 ~sum~0))), 33065#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~front~0 (+ ~back~0 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (= (+ (* ~front~0 4) ~queue~0.offset) 4) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (* ~n~0 4) (+ (* ~front~0 4) 12)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (= ~element~0 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0))), 33059#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (< ~front~0 0))), 33064#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 33060#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 33068#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 33072#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~sum~0 1)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ ~element~0 1) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= 1 ~sum~0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~sum~0 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= 1 ~sum~0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= (+ ~element~0 1) 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)))), 33055#(and (or (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 0) (< ~front~0 0))), 33061#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (< ~front~0 0))), 33058#(and (or (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 33056#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (< ~front~0 0))), 33069#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 33062#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 33063#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 33070#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~back~0 3)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)))] [2022-03-15 19:15:55,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 19:15:55,223 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:15:55,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 19:15:55,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=767, Invalid=5669, Unknown=44, NotChecked=0, Total=6480 [2022-03-15 19:15:55,223 INFO L87 Difference]: Start difference. First operand 414 states and 1107 transitions. Second operand has 41 states, 40 states have (on average 2.15) internal successors, (86), 40 states have internal predecessors, (86), 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) [2022-03-15 19:16:39,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:16:39,184 INFO L93 Difference]: Finished difference Result 3694 states and 9157 transitions. [2022-03-15 19:16:39,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2022-03-15 19:16:39,184 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.15) internal successors, (86), 40 states have internal predecessors, (86), 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) Word has length 30 [2022-03-15 19:16:39,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:16:39,194 INFO L225 Difference]: With dead ends: 3694 [2022-03-15 19:16:39,194 INFO L226 Difference]: Without dead ends: 3142 [2022-03-15 19:16:39,198 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22654 ImplicationChecksByTransitivity, 110.1s TimeCoverageRelationStatistics Valid=6602, Invalid=63314, Unknown=44, NotChecked=0, Total=69960 [2022-03-15 19:16:39,198 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 709 mSDsluCounter, 2165 mSDsCounter, 0 mSdLazyCounter, 6434 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 6747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 6434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:16:39,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [709 Valid, 10 Invalid, 6747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 6434 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-03-15 19:16:39,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3142 states. [2022-03-15 19:16:39,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3142 to 886. [2022-03-15 19:16:39,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 885 states have (on average 2.951412429378531) internal successors, (2612), 885 states have internal predecessors, (2612), 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) [2022-03-15 19:16:39,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 2612 transitions. [2022-03-15 19:16:39,223 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 2612 transitions. Word has length 30 [2022-03-15 19:16:39,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:16:39,224 INFO L470 AbstractCegarLoop]: Abstraction has 886 states and 2612 transitions. [2022-03-15 19:16:39,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.15) internal successors, (86), 40 states have internal predecessors, (86), 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) [2022-03-15 19:16:39,224 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 2612 transitions. [2022-03-15 19:16:39,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:16:39,225 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:16:39,225 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:16:39,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-03-15 19:16:39,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-03-15 19:16:39,447 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:16:39,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:16:39,448 INFO L85 PathProgramCache]: Analyzing trace with hash 326468969, now seen corresponding path program 29 times [2022-03-15 19:16:39,448 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:16:39,449 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637669122] [2022-03-15 19:16:39,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:16:39,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:16:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:16:40,594 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:16:40,595 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:16:40,595 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637669122] [2022-03-15 19:16:40,595 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637669122] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:16:40,595 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620496088] [2022-03-15 19:16:40,595 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:16:40,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:16:40,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:16:40,596 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:16:40,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-03-15 19:16:40,734 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:16:40,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:16:40,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 70 conjunts are in the unsatisfiable core [2022-03-15 19:16:40,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:16:42,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:16:42,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:16:42,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:16:42,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:16:42,058 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:16:42,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:16:42,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:16:42,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:16:42,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:16:42,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:16:42,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:16:42,062 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:16:42,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:16:42,063 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:16:42,068 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:16:42,068 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 86 treesize of output 35 [2022-03-15 19:16:42,108 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:16:42,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:16:59,557 INFO L353 Elim1Store]: treesize reduction 341, result has 27.4 percent of original size [2022-03-15 19:16:59,557 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 352 treesize of output 330 [2022-03-15 19:17:01,278 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 33 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:01,279 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620496088] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:17:01,279 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:17:01,279 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 18] total 55 [2022-03-15 19:17:01,279 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1098969294] [2022-03-15 19:17:01,279 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:17:01,283 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:17:01,300 INFO L252 McrAutomatonBuilder]: Finished intersection with 65 states and 106 transitions. [2022-03-15 19:17:01,300 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:17:30,365 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [39152#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~back~0 3)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 39139#(and (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0))), 39150#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 39148#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 39154#(and (or (<= ~n~0 ~front~0) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0)) (or (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~n~0 ~front~0) (< ~front~0 0))), 39142#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (< ~front~0 0))), 39138#(and (<= (+ ~sum~0 ~element~0) 0) (<= 0 (+ ~sum~0 ~element~0))), 39143#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0))), 39145#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 39146#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (< ~front~0 0))), 39151#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 39149#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 39153#(and (or (< ~back~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 39155#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (* ~n~0 4) (+ (* ~back~0 4) 8)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 1)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0))), 39147#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 39144#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (< ~front~0 0))), 39141#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 0) (< ~front~0 0)) (or (< ~back~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 0) (< ~front~0 0))), 39157#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 1 (+ ~sum~0 ~element~0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 ~element~0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 ~element~0) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 ~element~0) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0))), 39140#(and (or (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 0) (< ~front~0 0))), 39156#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (= (* ~front~0 4) (* ~back~0 4))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (< 3 (+ (* ~front~0 4) ~queue~0.offset)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= (+ ~front~0 ~n~0) (+ ~back~0 4)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~element~0 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)))] [2022-03-15 19:17:30,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-15 19:17:30,366 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:17:30,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-15 19:17:30,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=685, Invalid=5139, Unknown=28, NotChecked=0, Total=5852 [2022-03-15 19:17:30,367 INFO L87 Difference]: Start difference. First operand 886 states and 2612 transitions. Second operand has 42 states, 41 states have (on average 2.0) internal successors, (82), 41 states have internal predecessors, (82), 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) [2022-03-15 19:17:38,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:17:38,558 INFO L93 Difference]: Finished difference Result 557 states and 1274 transitions. [2022-03-15 19:17:38,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-15 19:17:38,559 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.0) internal successors, (82), 41 states have internal predecessors, (82), 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) Word has length 30 [2022-03-15 19:17:38,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:17:38,560 INFO L225 Difference]: With dead ends: 557 [2022-03-15 19:17:38,560 INFO L226 Difference]: Without dead ends: 428 [2022-03-15 19:17:38,561 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3635 ImplicationChecksByTransitivity, 47.6s TimeCoverageRelationStatistics Valid=1743, Invalid=11569, Unknown=28, NotChecked=0, Total=13340 [2022-03-15 19:17:38,561 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 524 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 1762 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 1955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 1762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:17:38,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [524 Valid, 11 Invalid, 1955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 1762 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 19:17:38,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-03-15 19:17:38,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 324. [2022-03-15 19:17:38,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 2.5510835913312695) internal successors, (824), 323 states have internal predecessors, (824), 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) [2022-03-15 19:17:38,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 824 transitions. [2022-03-15 19:17:38,567 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 824 transitions. Word has length 30 [2022-03-15 19:17:38,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:17:38,567 INFO L470 AbstractCegarLoop]: Abstraction has 324 states and 824 transitions. [2022-03-15 19:17:38,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.0) internal successors, (82), 41 states have internal predecessors, (82), 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) [2022-03-15 19:17:38,567 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 824 transitions. [2022-03-15 19:17:38,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:17:38,568 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:17:38,568 INFO L514 BasicCegarLoop]: trace histogram [7, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:17:38,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-03-15 19:17:38,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:17:38,769 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:17:38,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:17:38,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1274888434, now seen corresponding path program 30 times [2022-03-15 19:17:38,770 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:17:38,770 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37052349] [2022-03-15 19:17:38,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:17:38,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:17:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:17:40,896 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:17:40,896 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:17:40,896 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37052349] [2022-03-15 19:17:40,896 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37052349] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:17:40,896 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767930960] [2022-03-15 19:17:40,896 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:17:40,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:17:40,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:17:40,897 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:17:40,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-03-15 19:17:41,505 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 19:17:41,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:17:41,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 58 conjunts are in the unsatisfiable core [2022-03-15 19:17:41,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:17:42,270 INFO L353 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2022-03-15 19:17:42,271 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 74 treesize of output 20 [2022-03-15 19:17:42,400 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:17:42,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:17:43,464 INFO L353 Elim1Store]: treesize reduction 243, result has 5.1 percent of original size [2022-03-15 19:17:43,465 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 312 treesize of output 206 [2022-03-15 19:17:44,077 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-03-15 19:17:44,077 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767930960] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:17:44,077 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:17:44,077 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 13] total 50 [2022-03-15 19:17:44,077 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [342936834] [2022-03-15 19:17:44,078 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:17:44,082 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:17:44,098 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 105 transitions. [2022-03-15 19:17:44,098 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:17:49,540 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [40677#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 40679#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 40667#(and (or (<= ~n~0 ~front~0) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0)) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~n~0 ~front~0) (< ~front~0 0))), 40670#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (< ~front~0 0))), 40668#(and (or (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (< ~front~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 1))), 40678#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 40680#(and (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 40673#(and (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 40672#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 ~front~0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= (+ 2 ~front~0) ~n~0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= 1 ~front~0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~element~0 1) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= ~element~0 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ 2 ~front~0) ~n~0) (<= ~n~0 ~back~0))), 40675#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (< ~front~0 0))), 40669#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (< ~front~0 0))), 40671#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= ~n~0 ~back~0) (< ~front~0 0))), 40676#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= (+ 2 ~front~0) ~n~0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~element~0 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 ~front~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ 2 ~front~0) ~n~0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= 1 ~front~0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~element~0 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)))), 40674#(and (or (<= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (<= 1 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (= ~sum~0 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= (+ 3 ~front~0) ~n~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= ~n~0 ~front~0) (< ~front~0 0)))] [2022-03-15 19:17:49,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 19:17:49,540 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:17:49,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 19:17:49,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=3882, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 19:17:49,541 INFO L87 Difference]: Start difference. First operand 324 states and 824 transitions. Second operand has 35 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 states have internal predecessors, (73), 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) [2022-03-15 19:17:52,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:17:52,831 INFO L93 Difference]: Finished difference Result 722 states and 1852 transitions. [2022-03-15 19:17:52,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 19:17:52,832 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 states have internal predecessors, (73), 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) Word has length 30 [2022-03-15 19:17:52,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:17:52,834 INFO L225 Difference]: With dead ends: 722 [2022-03-15 19:17:52,834 INFO L226 Difference]: Without dead ends: 695 [2022-03-15 19:17:52,834 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 37 SyntacticMatches, 10 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1285 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=665, Invalid=6141, Unknown=0, NotChecked=0, Total=6806 [2022-03-15 19:17:52,835 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 109 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:17:52,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 19 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:17:52,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2022-03-15 19:17:52,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 348. [2022-03-15 19:17:52,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 347 states have (on average 2.515850144092219) internal successors, (873), 347 states have internal predecessors, (873), 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) [2022-03-15 19:17:52,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 873 transitions. [2022-03-15 19:17:52,841 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 873 transitions. Word has length 30 [2022-03-15 19:17:52,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:17:52,841 INFO L470 AbstractCegarLoop]: Abstraction has 348 states and 873 transitions. [2022-03-15 19:17:52,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 states have internal predecessors, (73), 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) [2022-03-15 19:17:52,841 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 873 transitions. [2022-03-15 19:17:52,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:17:52,841 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:17:52,842 INFO L514 BasicCegarLoop]: trace histogram [7, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:17:52,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-03-15 19:17:53,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:17:53,055 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:17:53,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:17:53,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1554819378, now seen corresponding path program 31 times [2022-03-15 19:17:53,056 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:17:53,057 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281441042] [2022-03-15 19:17:53,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:17:53,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:17:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:18:08,648 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:08,649 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:18:08,649 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281441042] [2022-03-15 19:18:08,649 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281441042] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:18:08,649 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542854137] [2022-03-15 19:18:08,649 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:18:08,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:18:08,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:18:08,650 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:18:08,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-03-15 19:18:08,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:18:08,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 66 conjunts are in the unsatisfiable core [2022-03-15 19:18:08,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:18:09,477 INFO L353 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2022-03-15 19:18:09,478 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 74 treesize of output 20 [2022-03-15 19:18:09,578 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:18:09,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:18:10,804 INFO L353 Elim1Store]: treesize reduction 173, result has 32.4 percent of original size [2022-03-15 19:18:10,804 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 310 treesize of output 274 [2022-03-15 19:18:11,774 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-03-15 19:18:11,774 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542854137] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:18:11,774 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:18:11,774 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 13] total 51 [2022-03-15 19:18:11,774 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [852609894] [2022-03-15 19:18:11,774 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:18:11,778 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:18:11,794 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 95 transitions. [2022-03-15 19:18:11,794 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:18:16,731 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [42367#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (< ~front~0 0))), 42366#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= ~n~0 ~back~0) (< ~front~0 0))), 42362#(and (or (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (< ~front~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 1))), 42371#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 42365#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (< ~front~0 0))), 42364#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 1)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 1)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0))), 42360#(and (<= (+ ~sum~0 ~element~0) 1) (<= 1 (+ ~sum~0 ~element~0))), 42361#(and (or (<= ~n~0 ~front~0) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0)) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~n~0 ~front~0) (< ~front~0 0))), 42373#(and (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 42369#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 42374#(and (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= 1 ~sum~0) (< ~front~0 0)) (or (<= ~sum~0 1) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= (+ 2 ~front~0) ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0))), 42363#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (< ~front~0 0))), 42368#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= (* (div (+ ~queue~0.offset (* ~back~0 4) 4) 4) 4) (+ (* ~front~0 4) 4)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~front~0 ~back~0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0))), 42372#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 42370#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~sum~0 1) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~front~0 ~back~0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~sum~0 1) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (= (+ ~element~0 1) 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= 1 ~sum~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (+ ~element~0 1) 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= 1 ~sum~0)))] [2022-03-15 19:18:16,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 19:18:16,732 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:18:16,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 19:18:16,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=482, Invalid=4074, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 19:18:16,733 INFO L87 Difference]: Start difference. First operand 348 states and 873 transitions. Second operand has 37 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 36 states have internal predecessors, (71), 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) [2022-03-15 19:18:19,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:18:19,582 INFO L93 Difference]: Finished difference Result 712 states and 1811 transitions. [2022-03-15 19:18:19,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 19:18:19,582 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 36 states have internal predecessors, (71), 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) Word has length 30 [2022-03-15 19:18:19,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:18:19,585 INFO L225 Difference]: With dead ends: 712 [2022-03-15 19:18:19,585 INFO L226 Difference]: Without dead ends: 691 [2022-03-15 19:18:19,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1844 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=714, Invalid=6768, Unknown=0, NotChecked=0, Total=7482 [2022-03-15 19:18:19,586 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 125 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:18:19,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 16 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1105 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 19:18:19,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2022-03-15 19:18:19,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 325. [2022-03-15 19:18:19,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 324 states have (on average 2.549382716049383) internal successors, (826), 324 states have internal predecessors, (826), 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) [2022-03-15 19:18:19,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 826 transitions. [2022-03-15 19:18:19,592 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 826 transitions. Word has length 30 [2022-03-15 19:18:19,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:18:19,592 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 826 transitions. [2022-03-15 19:18:19,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 36 states have internal predecessors, (71), 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) [2022-03-15 19:18:19,592 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 826 transitions. [2022-03-15 19:18:19,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:18:19,593 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:18:19,593 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:18:19,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-03-15 19:18:19,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:18:19,807 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:18:19,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:18:19,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1111115944, now seen corresponding path program 32 times [2022-03-15 19:18:19,808 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:18:19,809 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264511951] [2022-03-15 19:18:19,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:18:19,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:18:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:18:25,182 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:25,182 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:18:25,182 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264511951] [2022-03-15 19:18:25,182 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264511951] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:18:25,182 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430675898] [2022-03-15 19:18:25,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:18:25,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:18:25,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:18:25,184 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:18:25,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-03-15 19:18:25,307 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:18:25,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:18:25,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 63 conjunts are in the unsatisfiable core [2022-03-15 19:18:25,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:18:26,240 INFO L353 Elim1Store]: treesize reduction 108, result has 0.9 percent of original size [2022-03-15 19:18:26,240 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 98 treesize of output 26 [2022-03-15 19:18:26,358 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:18:26,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:18:27,772 INFO L353 Elim1Store]: treesize reduction 281, result has 41.9 percent of original size [2022-03-15 19:18:27,772 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 360 treesize of output 408 [2022-03-15 19:18:29,579 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:18:29,579 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430675898] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:18:29,579 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:18:29,579 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 14] total 52 [2022-03-15 19:18:29,580 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1648720781] [2022-03-15 19:18:29,580 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:18:29,593 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:18:29,613 INFO L252 McrAutomatonBuilder]: Finished intersection with 74 states and 127 transitions. [2022-03-15 19:18:29,614 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:18:38,234 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [44024#(and (or (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 12)) 1) 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= ~sum~0 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= 2 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= ~n~0 ~front~0) (< ~front~0 0))), 44027#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) ~element~0) 2) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) ~element~0) 2)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= 2 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) ~element~0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 2 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) ~element~0)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0))), 44015#(and (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 44023#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~back~0 3)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 44026#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) ~element~0) 2) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) ~element~0) 2) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 2 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) ~element~0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= 2 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) ~element~0)) (<= ~n~0 ~back~0))), 44013#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~front~0 1)) (< ~front~0 0))), 44022#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 44028#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) ~element~0) 2) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (<= 2 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) ~element~0)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) ~element~0) 2) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= 2 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) ~element~0))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 44009#(and (<= (+ ~sum~0 ~element~0) 0) (<= 0 (+ ~sum~0 ~element~0))), 44019#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 44014#(and (or (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 44017#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 44011#(and (or (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 0) (< ~front~0 0))), 44020#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 44021#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 44012#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (< ~front~0 0))), 44010#(and (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0))), 44025#(and (or (< ~back~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 44016#(and (or (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 44018#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)))] [2022-03-15 19:18:38,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-15 19:18:38,235 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:18:38,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-15 19:18:38,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=473, Invalid=4929, Unknown=0, NotChecked=0, Total=5402 [2022-03-15 19:18:38,236 INFO L87 Difference]: Start difference. First operand 325 states and 826 transitions. Second operand has 42 states, 41 states have (on average 2.2195121951219514) internal successors, (91), 41 states have internal predecessors, (91), 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) [2022-03-15 19:18:44,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:18:44,178 INFO L93 Difference]: Finished difference Result 719 states and 1841 transitions. [2022-03-15 19:18:44,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 19:18:44,179 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.2195121951219514) internal successors, (91), 41 states have internal predecessors, (91), 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) Word has length 31 [2022-03-15 19:18:44,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:18:44,181 INFO L225 Difference]: With dead ends: 719 [2022-03-15 19:18:44,181 INFO L226 Difference]: Without dead ends: 690 [2022-03-15 19:18:44,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 44 SyntacticMatches, 7 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1998 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=812, Invalid=8500, Unknown=0, NotChecked=0, Total=9312 [2022-03-15 19:18:44,182 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 135 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 1948 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 2006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:18:44,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 21 Invalid, 2006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1948 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 19:18:44,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2022-03-15 19:18:44,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 376. [2022-03-15 19:18:44,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 375 states have (on average 2.546666666666667) internal successors, (955), 375 states have internal predecessors, (955), 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) [2022-03-15 19:18:44,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 955 transitions. [2022-03-15 19:18:44,201 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 955 transitions. Word has length 31 [2022-03-15 19:18:44,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:18:44,201 INFO L470 AbstractCegarLoop]: Abstraction has 376 states and 955 transitions. [2022-03-15 19:18:44,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.2195121951219514) internal successors, (91), 41 states have internal predecessors, (91), 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) [2022-03-15 19:18:44,201 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 955 transitions. [2022-03-15 19:18:44,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:18:44,202 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:18:44,202 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:18:44,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-03-15 19:18:44,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-03-15 19:18:44,413 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:18:44,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:18:44,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1614548888, now seen corresponding path program 33 times [2022-03-15 19:18:44,414 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:18:44,414 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605530999] [2022-03-15 19:18:44,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:18:44,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:18:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:18:46,608 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:46,608 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:18:46,608 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605530999] [2022-03-15 19:18:46,608 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605530999] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:18:46,608 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195525067] [2022-03-15 19:18:46,608 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:18:46,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:18:46,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:18:46,610 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:18:46,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-03-15 19:18:46,799 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:18:46,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:18:46,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 51 conjunts are in the unsatisfiable core [2022-03-15 19:18:46,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:18:47,637 INFO L353 Elim1Store]: treesize reduction 108, result has 0.9 percent of original size [2022-03-15 19:18:47,637 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 98 treesize of output 26 [2022-03-15 19:18:47,761 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:18:47,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:18:49,284 INFO L353 Elim1Store]: treesize reduction 345, result has 28.7 percent of original size [2022-03-15 19:18:49,284 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 350 treesize of output 334 [2022-03-15 19:18:50,545 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:18:50,545 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195525067] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:18:50,545 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:18:50,545 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16, 15] total 51 [2022-03-15 19:18:50,545 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2044096381] [2022-03-15 19:18:50,545 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:18:50,549 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:18:50,568 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 117 transitions. [2022-03-15 19:18:50,568 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:18:57,873 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [45796#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 12)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= (* ~front~0 4) (* ~back~0 4))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0))), 45786#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 45781#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (< ~front~0 0))), 45792#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (= (+ ~element~0 1) 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (+ ~element~0 1) 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0))), 45793#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~back~0 3)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 45785#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 45784#(and (or (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 45782#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~front~0 1)) (< ~front~0 0))), 45790#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 45783#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (< ~front~0 0))), 45789#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 45779#(and (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0))), 45794#(and (or (< ~back~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 45787#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 45795#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~element~0 1) (< (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 8)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 8)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 8)) (<= ~n~0 ~back~0) (= (+ (* ~front~0 4) 4) (* ~back~0 4)))), 45791#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 45780#(and (or (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 0) (< ~front~0 0))), 45788#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 45797#(and (or (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~front~0) (< ~front~0 0)))] [2022-03-15 19:18:57,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-15 19:18:57,873 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:18:57,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-15 19:18:57,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=4700, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 19:18:57,874 INFO L87 Difference]: Start difference. First operand 376 states and 955 transitions. Second operand has 42 states, 41 states have (on average 2.073170731707317) internal successors, (85), 41 states have internal predecessors, (85), 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) [2022-03-15 19:19:05,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:19:05,250 INFO L93 Difference]: Finished difference Result 775 states and 2015 transitions. [2022-03-15 19:19:05,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 19:19:05,251 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.073170731707317) internal successors, (85), 41 states have internal predecessors, (85), 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) Word has length 31 [2022-03-15 19:19:05,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:19:05,253 INFO L225 Difference]: With dead ends: 775 [2022-03-15 19:19:05,253 INFO L226 Difference]: Without dead ends: 750 [2022-03-15 19:19:05,253 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1887 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=777, Invalid=8925, Unknown=0, NotChecked=0, Total=9702 [2022-03-15 19:19:05,254 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 151 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 1874 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 1971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:19:05,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 15 Invalid, 1971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1874 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 19:19:05,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2022-03-15 19:19:05,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 384. [2022-03-15 19:19:05,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 383 states have (on average 2.545691906005222) internal successors, (975), 383 states have internal predecessors, (975), 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) [2022-03-15 19:19:05,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 975 transitions. [2022-03-15 19:19:05,260 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 975 transitions. Word has length 31 [2022-03-15 19:19:05,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:19:05,260 INFO L470 AbstractCegarLoop]: Abstraction has 384 states and 975 transitions. [2022-03-15 19:19:05,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.073170731707317) internal successors, (85), 41 states have internal predecessors, (85), 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) [2022-03-15 19:19:05,260 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 975 transitions. [2022-03-15 19:19:05,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:19:05,261 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:19:05,261 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:19:05,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-03-15 19:19:05,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-03-15 19:19:05,475 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:19:05,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:19:05,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1894479832, now seen corresponding path program 34 times [2022-03-15 19:19:05,477 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:19:05,477 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776307072] [2022-03-15 19:19:05,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:19:05,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:19:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:19:06,827 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:19:06,827 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:19:06,827 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776307072] [2022-03-15 19:19:06,827 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776307072] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:19:06,827 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808217922] [2022-03-15 19:19:06,827 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:19:06,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:19:06,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:19:06,828 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:19:06,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-03-15 19:19:06,943 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:19:06,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:19:06,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 78 conjunts are in the unsatisfiable core [2022-03-15 19:19:06,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:19:08,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:19:08,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:19:08,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:19:08,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:19:08,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:19:08,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:19:08,141 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:19:08,141 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 29 [2022-03-15 19:19:08,256 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:19:08,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:19:09,967 INFO L353 Elim1Store]: treesize reduction 467, result has 3.5 percent of original size [2022-03-15 19:19:09,968 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 354 treesize of output 216 [2022-03-15 19:19:10,572 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:19:10,572 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808217922] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:19:10,572 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:19:10,572 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 21] total 63 [2022-03-15 19:19:10,572 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1075394421] [2022-03-15 19:19:10,572 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:19:10,576 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:19:10,594 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 107 transitions. [2022-03-15 19:19:10,594 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:19:17,795 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [47649#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 47656#(and (or (<= ~sum~0 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= 0 ~sum~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= ~n~0 ~front~0) (< ~front~0 0))), 47643#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 0) (< ~front~0 0)) (or (< ~back~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 0) (< ~front~0 0))), 47650#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 47651#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 47647#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (< ~front~0 0))), 47653#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 47646#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0))), 47657#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~back~0 3)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 47652#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 47644#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~element~0 1) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 ~sum~0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= ~element~0 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 ~sum~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0))), 47648#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 47640#(and (<= (+ ~sum~0 ~element~0) 0) (<= 0 (+ ~sum~0 ~element~0))), 47659#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~element~0 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= (* ~front~0 4) (* ~back~0 4)))), 47655#(and (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~element~0 1) (<= ~n~0 ~back~0)) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (+ (* ~front~0 4) 4) (* ~back~0 4))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0))), 47641#(and (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0))), 47642#(and (or (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 0) (< ~front~0 0))), 47654#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 47645#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (< ~front~0 0))), 47658#(and (or (< ~back~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)))] [2022-03-15 19:19:17,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-03-15 19:19:17,796 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:19:17,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-03-15 19:19:17,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=959, Invalid=6181, Unknown=0, NotChecked=0, Total=7140 [2022-03-15 19:19:17,797 INFO L87 Difference]: Start difference. First operand 384 states and 975 transitions. Second operand has 43 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 42 states have internal predecessors, (83), 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) [2022-03-15 19:19:24,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:19:24,651 INFO L93 Difference]: Finished difference Result 1025 states and 2637 transitions. [2022-03-15 19:19:24,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-03-15 19:19:24,651 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 42 states have internal predecessors, (83), 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) Word has length 31 [2022-03-15 19:19:24,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:19:24,654 INFO L225 Difference]: With dead ends: 1025 [2022-03-15 19:19:24,654 INFO L226 Difference]: Without dead ends: 974 [2022-03-15 19:19:24,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3982 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=1907, Invalid=12855, Unknown=0, NotChecked=0, Total=14762 [2022-03-15 19:19:24,655 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 212 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 2338 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 2480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 2338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:19:24,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 10 Invalid, 2480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 2338 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-15 19:19:24,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2022-03-15 19:19:24,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 462. [2022-03-15 19:19:24,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 461 states have (on average 2.6811279826464207) internal successors, (1236), 461 states have internal predecessors, (1236), 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) [2022-03-15 19:19:24,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 1236 transitions. [2022-03-15 19:19:24,664 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 1236 transitions. Word has length 31 [2022-03-15 19:19:24,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:19:24,664 INFO L470 AbstractCegarLoop]: Abstraction has 462 states and 1236 transitions. [2022-03-15 19:19:24,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 42 states have internal predecessors, (83), 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) [2022-03-15 19:19:24,664 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 1236 transitions. [2022-03-15 19:19:24,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:19:24,665 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:19:24,665 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:19:24,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-03-15 19:19:24,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:19:24,866 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:19:24,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:19:24,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1719102100, now seen corresponding path program 35 times [2022-03-15 19:19:24,868 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:19:24,868 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976073490] [2022-03-15 19:19:24,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:19:24,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:19:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:19:27,925 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:19:27,925 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:19:27,925 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976073490] [2022-03-15 19:19:27,925 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976073490] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:19:27,925 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240197998] [2022-03-15 19:19:27,925 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:19:27,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:19:27,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:19:27,926 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:19:27,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-03-15 19:19:28,066 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:19:28,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:19:28,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 66 conjunts are in the unsatisfiable core [2022-03-15 19:19:28,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:19:28,973 INFO L353 Elim1Store]: treesize reduction 108, result has 0.9 percent of original size [2022-03-15 19:19:28,974 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 101 treesize of output 29 [2022-03-15 19:19:29,097 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:19:29,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:19:30,741 INFO L353 Elim1Store]: treesize reduction 345, result has 28.7 percent of original size [2022-03-15 19:19:30,742 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 358 treesize of output 342 [2022-03-15 19:19:31,552 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:19:31,552 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240197998] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:19:31,552 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:19:31,552 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 14] total 52 [2022-03-15 19:19:31,552 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1496480877] [2022-03-15 19:19:31,553 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:19:31,556 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:19:31,575 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 117 transitions. [2022-03-15 19:19:31,576 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:19:39,222 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [49931#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 49930#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< ~front~0 (+ ~back~0 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (<= 1 ~element~0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~element~0 1) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0))), 49936#(and (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 2) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= 2 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (<= ~n~0 ~front~0) (< ~front~0 0))), 49922#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (< ~front~0 0))), 49924#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 2 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (= (+ ~element~0 1) 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (+ ~element~0 1) 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 2 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0))), 49927#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 49933#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ ~element~0 1) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 2 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 2 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= (+ ~element~0 1) 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)))), 49918#(and (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0))), 49928#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 49929#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 49932#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 49917#(and (<= (+ ~sum~0 ~element~0) 0) (<= 0 (+ ~sum~0 ~element~0))), 49919#(and (or (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 0) (< ~front~0 0))), 49926#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 49920#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (< ~front~0 0))), 49934#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~back~0 3)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 49921#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~front~0 1)) (< ~front~0 0))), 49923#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (< ~front~0 0))), 49925#(and (or (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 49935#(and (or (< ~back~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)))] [2022-03-15 19:19:39,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-15 19:19:39,222 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:19:39,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-15 19:19:39,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=4939, Unknown=0, NotChecked=0, Total=5402 [2022-03-15 19:19:39,223 INFO L87 Difference]: Start difference. First operand 462 states and 1236 transitions. Second operand has 42 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 41 states have internal predecessors, (87), 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) [2022-03-15 19:20:43,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:20:43,228 INFO L93 Difference]: Finished difference Result 3031 states and 7425 transitions. [2022-03-15 19:20:43,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 254 states. [2022-03-15 19:20:43,228 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 41 states have internal predecessors, (87), 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) Word has length 31 [2022-03-15 19:20:43,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:20:43,233 INFO L225 Difference]: With dead ends: 3031 [2022-03-15 19:20:43,233 INFO L226 Difference]: Without dead ends: 2576 [2022-03-15 19:20:43,236 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30164 ImplicationChecksByTransitivity, 57.7s TimeCoverageRelationStatistics Valid=8484, Invalid=84846, Unknown=0, NotChecked=0, Total=93330 [2022-03-15 19:20:43,236 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 763 mSDsluCounter, 3882 mSDsCounter, 0 mSdLazyCounter, 12084 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 12498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 12084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:20:43,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [763 Valid, 14 Invalid, 12498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 12084 Invalid, 0 Unknown, 0 Unchecked, 10.9s Time] [2022-03-15 19:20:43,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2022-03-15 19:20:43,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 800. [2022-03-15 19:20:43,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 799 states have (on average 2.9499374217772214) internal successors, (2357), 799 states have internal predecessors, (2357), 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) [2022-03-15 19:20:43,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 2357 transitions. [2022-03-15 19:20:43,256 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 2357 transitions. Word has length 31 [2022-03-15 19:20:43,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:20:43,256 INFO L470 AbstractCegarLoop]: Abstraction has 800 states and 2357 transitions. [2022-03-15 19:20:43,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 41 states have internal predecessors, (87), 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) [2022-03-15 19:20:43,257 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 2357 transitions. [2022-03-15 19:20:43,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:20:43,258 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:20:43,258 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:20:43,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-03-15 19:20:43,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-03-15 19:20:43,464 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:20:43,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:20:43,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1999033044, now seen corresponding path program 36 times [2022-03-15 19:20:43,467 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:20:43,467 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857959162] [2022-03-15 19:20:43,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:43,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:20:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:44,716 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:20:44,716 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:20:44,716 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857959162] [2022-03-15 19:20:44,716 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857959162] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:20:44,716 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38591178] [2022-03-15 19:20:44,716 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:20:44,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:44,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:20:44,718 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:20:44,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-03-15 19:20:44,935 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:20:44,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:20:44,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 80 conjunts are in the unsatisfiable core [2022-03-15 19:20:44,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:20:45,998 INFO L353 Elim1Store]: treesize reduction 108, result has 0.9 percent of original size [2022-03-15 19:20:45,998 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 98 treesize of output 26 [2022-03-15 19:20:46,128 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:20:46,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:20:47,974 INFO L353 Elim1Store]: treesize reduction 467, result has 3.5 percent of original size [2022-03-15 19:20:47,975 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 352 treesize of output 214 [2022-03-15 19:20:48,620 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:20:48,620 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38591178] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:20:48,620 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:20:48,620 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22, 21] total 62 [2022-03-15 19:20:48,620 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1579996097] [2022-03-15 19:20:48,620 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:20:48,624 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:20:48,642 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 107 transitions. [2022-03-15 19:20:48,642 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:20:56,036 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [55287#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 55276#(and (<= (+ ~sum~0 ~element~0) 0) (<= 0 (+ ~sum~0 ~element~0))), 55295#(and (or (< ~back~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 55277#(and (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0))), 55279#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 0) (< ~front~0 0)) (or (< ~back~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 0) (< ~front~0 0))), 55291#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 55294#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~back~0 3)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 55288#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (= (* ~front~0 4) (* ~back~0 4))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 11)) (= ~element~0 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0))), 55289#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~element~0 1) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 ~sum~0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= ~element~0 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 ~sum~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0))), 55284#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (< ~front~0 0))), 55292#(and (or (<= ~sum~0 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= 0 ~sum~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= ~n~0 ~front~0) (< ~front~0 0))), 55286#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 55283#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 55285#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 55278#(and (or (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 0) (< ~front~0 0))), 55280#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (< ~front~0 0))), 55290#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 55293#(and (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= 1 ~sum~0)) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~sum~0 1) (<= ~n~0 ~back~0)) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (+ ~element~0 1) 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (<= (* ~n~0 4) (+ 7 ~queue~0.offset (* ~back~0 4))) (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0))), 55281#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0))), 55282#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (< ~front~0 0)))] [2022-03-15 19:20:56,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-15 19:20:56,037 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:20:56,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-15 19:20:56,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1122, Invalid=5850, Unknown=0, NotChecked=0, Total=6972 [2022-03-15 19:20:56,037 INFO L87 Difference]: Start difference. First operand 800 states and 2357 transitions. Second operand has 42 states, 41 states have (on average 2.024390243902439) internal successors, (83), 41 states have internal predecessors, (83), 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) [2022-03-15 19:21:06,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:21:06,771 INFO L93 Difference]: Finished difference Result 1694 states and 4734 transitions. [2022-03-15 19:21:06,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-03-15 19:21:06,771 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.024390243902439) internal successors, (83), 41 states have internal predecessors, (83), 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) Word has length 31 [2022-03-15 19:21:06,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:21:06,774 INFO L225 Difference]: With dead ends: 1694 [2022-03-15 19:21:06,774 INFO L226 Difference]: Without dead ends: 1620 [2022-03-15 19:21:06,775 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4690 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=2404, Invalid=15152, Unknown=0, NotChecked=0, Total=17556 [2022-03-15 19:21:06,776 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 252 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 2791 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 2942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 2791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:21:06,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [252 Valid, 12 Invalid, 2942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 2791 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-03-15 19:21:06,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1620 states. [2022-03-15 19:21:06,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1620 to 860. [2022-03-15 19:21:06,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 859 states have (on average 2.960419091967404) internal successors, (2543), 859 states have internal predecessors, (2543), 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) [2022-03-15 19:21:06,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 2543 transitions. [2022-03-15 19:21:06,790 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 2543 transitions. Word has length 31 [2022-03-15 19:21:06,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:21:06,791 INFO L470 AbstractCegarLoop]: Abstraction has 860 states and 2543 transitions. [2022-03-15 19:21:06,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.024390243902439) internal successors, (83), 41 states have internal predecessors, (83), 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) [2022-03-15 19:21:06,791 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 2543 transitions. [2022-03-15 19:21:06,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:21:06,792 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:21:06,792 INFO L514 BasicCegarLoop]: trace histogram [8, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:21:06,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-03-15 19:21:06,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-03-15 19:21:06,994 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:21:06,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:21:06,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1347514787, now seen corresponding path program 37 times [2022-03-15 19:21:06,998 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:21:06,998 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730519729] [2022-03-15 19:21:06,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:21:06,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:21:07,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:11,160 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:21:11,160 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:21:11,160 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730519729] [2022-03-15 19:21:11,160 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730519729] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:21:11,161 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903945855] [2022-03-15 19:21:11,161 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:21:11,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:11,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:21:11,162 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:21:11,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-03-15 19:21:11,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:11,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 65 conjunts are in the unsatisfiable core [2022-03-15 19:21:11,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:21:12,104 INFO L353 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2022-03-15 19:21:12,104 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 76 treesize of output 22 [2022-03-15 19:21:12,221 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:21:12,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:21:13,324 INFO L353 Elim1Store]: treesize reduction 149, result has 41.8 percent of original size [2022-03-15 19:21:13,325 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 312 treesize of output 300 [2022-03-15 19:21:14,436 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-03-15 19:21:14,437 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903945855] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:21:14,437 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:21:14,437 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 12] total 51 [2022-03-15 19:21:14,437 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [76688269] [2022-03-15 19:21:14,437 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:21:14,440 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:21:14,458 INFO L252 McrAutomatonBuilder]: Finished intersection with 65 states and 106 transitions. [2022-03-15 19:21:14,458 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:21:19,770 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [59045#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (< ~front~0 0))), 59054#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 59043#(and (or (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (< ~front~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 1))), 59050#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (< ~front~0 0))), 59055#(and (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 59052#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~element~0 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (<= 4 (* ~front~0 4)) (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (<= 4 (* ~front~0 4)) (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~element~0 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)))), 59042#(and (or (<= ~n~0 ~front~0) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0)) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~n~0 ~front~0) (< ~front~0 0))), 59046#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= ~n~0 ~back~0) (< ~front~0 0))), 59047#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~element~0 1) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (<= 4 (* ~front~0 4)) (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (<= 4 (* ~front~0 4)) (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= ~element~0 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) (<= ~n~0 ~back~0))), 59041#(and (<= (+ ~sum~0 ~element~0) 1) (<= 1 (+ ~sum~0 ~element~0))), 59048#(and (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 59051#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 59049#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 59044#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (< ~front~0 0))), 59053#(and (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= ~sum~0 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= ~n~0 ~front~0) (< ~front~0 0)))] [2022-03-15 19:21:19,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 19:21:19,770 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:21:19,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 19:21:19,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=436, Invalid=4120, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 19:21:19,771 INFO L87 Difference]: Start difference. First operand 860 states and 2543 transitions. Second operand has 38 states, 37 states have (on average 2.054054054054054) internal successors, (76), 37 states have internal predecessors, (76), 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) [2022-03-15 19:21:24,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:21:24,179 INFO L93 Difference]: Finished difference Result 1552 states and 4524 transitions. [2022-03-15 19:21:24,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 19:21:24,180 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.054054054054054) internal successors, (76), 37 states have internal predecessors, (76), 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) Word has length 31 [2022-03-15 19:21:24,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:21:24,183 INFO L225 Difference]: With dead ends: 1552 [2022-03-15 19:21:24,183 INFO L226 Difference]: Without dead ends: 1525 [2022-03-15 19:21:24,183 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1295 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=718, Invalid=6254, Unknown=0, NotChecked=0, Total=6972 [2022-03-15 19:21:24,184 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 186 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:21:24,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 19 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:21:24,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2022-03-15 19:21:24,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 884. [2022-03-15 19:21:24,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 2.9354473386183466) internal successors, (2592), 883 states have internal predecessors, (2592), 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) [2022-03-15 19:21:24,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 2592 transitions. [2022-03-15 19:21:24,198 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 2592 transitions. Word has length 31 [2022-03-15 19:21:24,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:21:24,198 INFO L470 AbstractCegarLoop]: Abstraction has 884 states and 2592 transitions. [2022-03-15 19:21:24,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.054054054054054) internal successors, (76), 37 states have internal predecessors, (76), 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) [2022-03-15 19:21:24,199 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 2592 transitions. [2022-03-15 19:21:24,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:21:24,202 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:21:24,203 INFO L514 BasicCegarLoop]: trace histogram [8, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:21:24,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-03-15 19:21:24,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-03-15 19:21:24,410 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:21:24,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:21:24,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1067583843, now seen corresponding path program 38 times [2022-03-15 19:21:24,411 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:21:24,411 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710778014] [2022-03-15 19:21:24,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:21:24,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:21:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:31,215 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:21:31,215 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:21:31,215 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710778014] [2022-03-15 19:21:31,215 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710778014] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:21:31,215 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981850099] [2022-03-15 19:21:31,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:21:31,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:31,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:21:31,217 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:21:31,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-03-15 19:21:31,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:21:31,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:21:31,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 60 conjunts are in the unsatisfiable core [2022-03-15 19:21:31,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:21:32,039 INFO L353 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2022-03-15 19:21:32,039 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 76 treesize of output 22 [2022-03-15 19:21:32,136 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:21:32,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:21:33,150 INFO L353 Elim1Store]: treesize reduction 173, result has 32.4 percent of original size [2022-03-15 19:21:33,150 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 302 treesize of output 266 [2022-03-15 19:21:34,214 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-03-15 19:21:34,215 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981850099] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:21:34,215 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:21:34,215 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 13] total 52 [2022-03-15 19:21:34,215 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1460987551] [2022-03-15 19:21:34,215 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:21:34,219 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:21:34,236 INFO L252 McrAutomatonBuilder]: Finished intersection with 61 states and 96 transitions. [2022-03-15 19:21:34,236 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:21:39,018 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [62650#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (< ~front~0 0))), 62654#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 62653#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~sum~0 1) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~sum~0 1) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (= (+ ~element~0 1) 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= 1 ~sum~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (+ ~element~0 1) 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= 1 ~sum~0))), 62642#(and (<= (+ ~sum~0 ~element~0) 1) (<= 1 (+ ~sum~0 ~element~0))), 62655#(and (or (< ~back~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 62644#(and (or (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (< ~front~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 1))), 62648#(and (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= 1 ~sum~0) (< ~front~0 0)) (or (<= ~sum~0 1) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (<= ~n~0 ~front~0) (< ~front~0 0))), 62652#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 62651#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 62643#(and (or (<= ~n~0 ~front~0) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0)) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1) (<= ~n~0 ~front~0) (< ~front~0 0))), 62645#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (< ~front~0 0))), 62656#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (< (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 8)) (<= ~n~0 ~back~0) (= (* ~front~0 4) (* ~back~0 4))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= ~element~0 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (< (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 8)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0))), 62646#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 1)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 1)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0))), 62649#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (<= ~n~0 ~back~0) (< ~front~0 0))), 62647#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 1) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (< ~front~0 0)))] [2022-03-15 19:21:39,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 19:21:39,018 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:21:39,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 19:21:39,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=4247, Unknown=0, NotChecked=0, Total=4692 [2022-03-15 19:21:39,019 INFO L87 Difference]: Start difference. First operand 884 states and 2592 transitions. Second operand has 37 states, 36 states have (on average 2.0) internal successors, (72), 36 states have internal predecessors, (72), 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) [2022-03-15 19:21:42,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:21:42,111 INFO L93 Difference]: Finished difference Result 1524 states and 4368 transitions. [2022-03-15 19:21:42,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-03-15 19:21:42,112 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.0) internal successors, (72), 36 states have internal predecessors, (72), 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) Word has length 31 [2022-03-15 19:21:42,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:21:42,115 INFO L225 Difference]: With dead ends: 1524 [2022-03-15 19:21:42,115 INFO L226 Difference]: Without dead ends: 1503 [2022-03-15 19:21:42,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2122 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=878, Invalid=8824, Unknown=0, NotChecked=0, Total=9702 [2022-03-15 19:21:42,116 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 177 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:21:42,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 18 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:21:42,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2022-03-15 19:21:42,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 861. [2022-03-15 19:21:42,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 860 states have (on average 2.9593023255813953) internal successors, (2545), 860 states have internal predecessors, (2545), 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) [2022-03-15 19:21:42,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 2545 transitions. [2022-03-15 19:21:42,130 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 2545 transitions. Word has length 31 [2022-03-15 19:21:42,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:21:42,131 INFO L470 AbstractCegarLoop]: Abstraction has 861 states and 2545 transitions. [2022-03-15 19:21:42,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.0) internal successors, (72), 36 states have internal predecessors, (72), 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) [2022-03-15 19:21:42,131 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 2545 transitions. [2022-03-15 19:21:42,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:21:42,132 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:21:42,132 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:21:42,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-03-15 19:21:42,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:42,342 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:21:42,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:21:42,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1257537551, now seen corresponding path program 39 times [2022-03-15 19:21:42,344 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:21:42,344 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586242688] [2022-03-15 19:21:42,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:21:42,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:21:42,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:42,476 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 25 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:21:42,476 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:21:42,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586242688] [2022-03-15 19:21:42,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586242688] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:21:42,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713066942] [2022-03-15 19:21:42,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:21:42,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:42,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:21:42,480 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:21:42,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-03-15 19:21:42,902 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 19:21:42,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:21:42,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 19:21:42,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:21:43,035 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 100 [2022-03-15 19:21:43,178 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 28 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:21:43,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:21:43,318 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:21:43,323 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:21:43,481 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 25 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:21:43,481 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713066942] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:21:43,481 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:21:43,482 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 33 [2022-03-15 19:21:43,482 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [126740746] [2022-03-15 19:21:43,482 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:21:43,485 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:21:43,509 INFO L252 McrAutomatonBuilder]: Finished intersection with 81 states and 142 transitions. [2022-03-15 19:21:43,509 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:21:44,119 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:21:44,126 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:21:44,237 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:21:44,246 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:21:44,665 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:21:44,673 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:21:44,798 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:21:44,806 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:21:44,941 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:21:44,949 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:21:45,077 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:21:45,094 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:21:45,402 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:21:45,409 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-03-15 19:21:45,484 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [66194#(or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~back~0 (+ ~front~0 4)) (< ~front~0 0)), 66193#(or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~back~0 (+ ~front~0 4)) (< (+ 5 ~front~0) ~back~0) (< ~front~0 0)), 66191#(or (<= ~back~0 (+ 3 ~front~0)) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (< (+ ~front~0 4) ~back~0) (< ~front~0 0)), 66189#(or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (< (+ 3 ~front~0) ~back~0) (<= ~back~0 (+ 2 ~front~0)) (< ~front~0 0)), 66197#(or (< ~back~0 0) (<= ~back~0 ~front~0)), 66187#(or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (< (+ 2 ~front~0) ~back~0) (<= ~back~0 (+ ~front~0 1)) (< ~front~0 0)), 66196#(or (< ~back~0 0) (<= ~back~0 (+ ~front~0 1))), 66185#(or (< (+ ~front~0 1) ~back~0) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (< ~front~0 0)), 66188#(or (< (+ 2 ~front~0) ~back~0) (<= ~back~0 (+ ~front~0 1)) (< ~front~0 0)), 66192#(or (<= ~back~0 (+ 3 ~front~0)) (< (+ ~front~0 4) ~back~0) (< ~front~0 0)), 66184#(< ~front~0 ~back~0), 66186#(or (< (+ ~front~0 1) ~back~0) (not (< ~front~0 ~back~0)) (< ~front~0 0)), 66190#(or (< (+ 3 ~front~0) ~back~0) (<= ~back~0 (+ 2 ~front~0)) (< ~front~0 0)), 66183#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))), 66195#(or (< ~back~0 0) (<= ~back~0 (+ 2 ~front~0)))] [2022-03-15 19:21:45,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 19:21:45,485 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:21:45,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 19:21:45,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=1882, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 19:21:45,485 INFO L87 Difference]: Start difference. First operand 861 states and 2545 transitions. Second operand has 27 states, 27 states have (on average 3.4074074074074074) internal successors, (92), 26 states have internal predecessors, (92), 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) [2022-03-15 19:21:46,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:21:46,440 INFO L93 Difference]: Finished difference Result 1511 states and 4174 transitions. [2022-03-15 19:21:46,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 19:21:46,441 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.4074074074074074) internal successors, (92), 26 states have internal predecessors, (92), 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) Word has length 32 [2022-03-15 19:21:46,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:21:46,444 INFO L225 Difference]: With dead ends: 1511 [2022-03-15 19:21:46,444 INFO L226 Difference]: Without dead ends: 1394 [2022-03-15 19:21:46,444 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 67 SyntacticMatches, 8 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2252 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=978, Invalid=4572, Unknown=0, NotChecked=0, Total=5550 [2022-03-15 19:21:46,445 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 270 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:21:46,445 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [270 Valid, 5 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:21:46,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2022-03-15 19:21:46,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 934. [2022-03-15 19:21:46,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 933 states have (on average 3.0064308681672025) internal successors, (2805), 933 states have internal predecessors, (2805), 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) [2022-03-15 19:21:46,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 2805 transitions. [2022-03-15 19:21:46,460 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 2805 transitions. Word has length 32 [2022-03-15 19:21:46,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:21:46,460 INFO L470 AbstractCegarLoop]: Abstraction has 934 states and 2805 transitions. [2022-03-15 19:21:46,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.4074074074074074) internal successors, (92), 26 states have internal predecessors, (92), 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) [2022-03-15 19:21:46,460 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 2805 transitions. [2022-03-15 19:21:46,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:21:46,461 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:21:46,461 INFO L514 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:21:46,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-03-15 19:21:46,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:46,674 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:21:46,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:21:46,675 INFO L85 PathProgramCache]: Analyzing trace with hash -801237171, now seen corresponding path program 40 times [2022-03-15 19:21:46,676 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:21:46,676 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689143698] [2022-03-15 19:21:46,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:21:46,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:21:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:54,014 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:21:54,014 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:21:54,014 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689143698] [2022-03-15 19:21:54,014 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689143698] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:21:54,014 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563533614] [2022-03-15 19:21:54,014 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:21:54,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:54,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:21:54,015 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:21:54,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-03-15 19:21:54,155 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:21:54,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:21:54,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 65 conjunts are in the unsatisfiable core [2022-03-15 19:21:54,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:21:55,068 INFO L353 Elim1Store]: treesize reduction 108, result has 0.9 percent of original size [2022-03-15 19:21:55,068 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 105 treesize of output 33 [2022-03-15 19:21:55,178 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:21:55,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:21:56,560 INFO L353 Elim1Store]: treesize reduction 345, result has 28.7 percent of original size [2022-03-15 19:21:56,560 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 350 treesize of output 334 [2022-03-15 19:21:57,778 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 19:21:57,778 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563533614] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:21:57,778 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:21:57,778 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 15] total 56 [2022-03-15 19:21:57,779 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [771615093] [2022-03-15 19:21:57,779 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:21:57,782 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:21:57,803 INFO L252 McrAutomatonBuilder]: Finished intersection with 75 states and 128 transitions. [2022-03-15 19:21:57,804 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:22:07,220 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [69879#(and (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 69875#(and (or (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 0) (< ~front~0 0))), 69890#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~back~0 3)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 69880#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 69881#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 69888#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 69884#(and (or (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 69892#(and (or (< ~back~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 69882#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (= (+ (select (select |#memory_int| ~queue~0.base) (+ 4 (* (div (+ (- 1) (* (div (+ (* ~front~0 4) ~queue~0.offset 8) 4) 4)) 4) 4))) 1) 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (+ (select (select |#memory_int| ~queue~0.base) (+ 4 (* (div (+ (- 1) (* (div (+ (* ~front~0 4) ~queue~0.offset 8) 4) 4)) 4) 4))) 1) 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= (+ 2 ~front~0) ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~element~0 1) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (* (div (+ (- 1) (* (div (+ (* ~front~0 4) ~queue~0.offset 8) 4) 4)) 4) 4)) 1) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (select (select |#memory_int| ~queue~0.base) (* (div (+ (- 1) (* (div (+ (* ~front~0 4) ~queue~0.offset 8) 4) 4)) 4) 4)) 1) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= (+ 2 ~front~0) ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= ~element~0 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0))), 69883#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~element~0 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= (select (select |#memory_int| ~queue~0.base) (* (div (+ (- 1) (* (div (+ (* ~front~0 4) ~queue~0.offset 8) 4) 4)) 4) 4)) 1)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ 4 (* (div (+ (- 1) (* (div (+ (* ~front~0 4) ~queue~0.offset 8) 4) 4)) 4) 4))) 1) 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (= (+ (select (select |#memory_int| ~queue~0.base) (+ 4 (* (div (+ (- 1) (* (div (+ (* ~front~0 4) ~queue~0.offset 8) 4) 4)) 4) 4))) 1) 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= (+ ~front~0 1) ~back~0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= (+ ~front~0 1) ~back~0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (select (select |#memory_int| ~queue~0.base) (* (div (+ (- 1) (* (div (+ (* ~front~0 4) ~queue~0.offset 8) 4) 4)) 4) 4)) 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~element~0 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)))), 69887#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 69891#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) (* (div (+ (- 1) (* (div (+ (* ~front~0 4) ~queue~0.offset 8) 4) 4)) 4) 4)) 1)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= ~element~0 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (= (select (select |#memory_int| ~queue~0.base) (* (div (+ (- 1) (* (div (+ (* ~front~0 4) ~queue~0.offset 8) 4) 4)) 4) 4)) 1) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= ~front~0 ~back~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= ~front~0 ~back~0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ 4 (* (div (+ (- 1) (* (div (+ (* ~front~0 4) ~queue~0.offset 8) 4) 4)) 4) 4))) 1) 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~element~0 1) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (= (+ (select (select |#memory_int| ~queue~0.base) (+ 4 (* (div (+ (- 1) (* (div (+ (* ~front~0 4) ~queue~0.offset 8) 4) 4)) 4) 4))) 1) 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))))), 69873#(and (<= (+ ~sum~0 ~element~0) 0) (<= 0 (+ ~sum~0 ~element~0))), 69885#(and (or (<= ~n~0 ~front~0) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* (div (+ (- 1) (* (div (+ (* ~front~0 4) ~queue~0.offset 12) 4) 4)) 4) 4) 4)) 1) 0) (< ~front~0 0)) (or (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= ~sum~0 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= (+ ~front~0 4) ~back~0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) 1)) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (select (select |#memory_int| ~queue~0.base) (* (div (+ (- 1) (* (div (+ (* ~front~0 4) ~queue~0.offset 12) 4) 4)) 4) 4)) 1) (<= ~n~0 ~front~0) (< ~front~0 0))), 69889#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 69874#(and (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0))), 69886#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 69876#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (< ~front~0 0))), 69877#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~front~0 1)) (< ~front~0 0))), 69878#(and (or (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)))] [2022-03-15 19:22:07,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-03-15 19:22:07,221 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:22:07,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-03-15 19:22:07,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=5413, Unknown=0, NotChecked=0, Total=6006 [2022-03-15 19:22:07,221 INFO L87 Difference]: Start difference. First operand 934 states and 2805 transitions. Second operand has 43 states, 42 states have (on average 2.1904761904761907) internal successors, (92), 42 states have internal predecessors, (92), 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) [2022-03-15 19:22:13,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:22:13,173 INFO L93 Difference]: Finished difference Result 1934 states and 5699 transitions. [2022-03-15 19:22:13,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 19:22:13,173 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.1904761904761907) internal successors, (92), 42 states have internal predecessors, (92), 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) Word has length 32 [2022-03-15 19:22:13,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:22:13,177 INFO L225 Difference]: With dead ends: 1934 [2022-03-15 19:22:13,177 INFO L226 Difference]: Without dead ends: 1901 [2022-03-15 19:22:13,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2853 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=1027, Invalid=9275, Unknown=0, NotChecked=0, Total=10302 [2022-03-15 19:22:13,178 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 128 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 1299 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:22:13,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 18 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1299 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 19:22:13,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2022-03-15 19:22:13,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 989. [2022-03-15 19:22:13,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 988 states have (on average 2.979757085020243) internal successors, (2944), 988 states have internal predecessors, (2944), 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) [2022-03-15 19:22:13,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 2944 transitions. [2022-03-15 19:22:13,197 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 2944 transitions. Word has length 32 [2022-03-15 19:22:13,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:22:13,197 INFO L470 AbstractCegarLoop]: Abstraction has 989 states and 2944 transitions. [2022-03-15 19:22:13,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.1904761904761907) internal successors, (92), 42 states have internal predecessors, (92), 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) [2022-03-15 19:22:13,197 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 2944 transitions. [2022-03-15 19:22:13,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:22:13,198 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:22:13,198 INFO L514 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:22:13,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-03-15 19:22:13,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-03-15 19:22:13,419 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:22:13,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:22:13,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1924427661, now seen corresponding path program 41 times [2022-03-15 19:22:13,421 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:22:13,421 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519404145] [2022-03-15 19:22:13,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:22:13,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:22:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:22:15,552 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:22:15,552 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:22:15,552 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519404145] [2022-03-15 19:22:15,553 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519404145] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:22:15,553 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149424917] [2022-03-15 19:22:15,553 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:22:15,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:22:15,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:22:15,554 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:22:15,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-03-15 19:22:15,705 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:22:15,705 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:22:15,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 65 conjunts are in the unsatisfiable core [2022-03-15 19:22:15,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:22:16,633 INFO L353 Elim1Store]: treesize reduction 108, result has 0.9 percent of original size [2022-03-15 19:22:16,634 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 101 treesize of output 29 [2022-03-15 19:22:16,749 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:22:16,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:22:18,201 INFO L353 Elim1Store]: treesize reduction 345, result has 28.7 percent of original size [2022-03-15 19:22:18,202 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 350 treesize of output 334 [2022-03-15 19:22:19,562 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 19:22:19,563 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149424917] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:22:19,563 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:22:19,563 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 15] total 56 [2022-03-15 19:22:19,563 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1770319222] [2022-03-15 19:22:19,563 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:22:19,567 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:22:19,606 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 118 transitions. [2022-03-15 19:22:19,606 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:22:26,834 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [74097#(and (<= (+ ~sum~0 ~element~0) 0) (<= 0 (+ ~sum~0 ~element~0))), 74104#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 74103#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~front~0 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~back~0) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~front~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (< ~front~0 0))), 74113#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= ~n~0 (+ ~back~0 3)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 74114#(and (or (< ~back~0 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 3)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 12)) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 74110#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 74099#(and (or (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0)) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0) 0) (< ~front~0 0))), 74115#(and (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 2) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= 2 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 8)) 1) 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= ~queue~0.offset 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (<= ~n~0 ~front~0) (< ~front~0 0))), 74101#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~front~0 1)) (< ~front~0 0))), 74105#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 74108#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 2 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 2) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) 4)) 1) 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (= (+ ~element~0 1) 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (= (+ ~element~0 1) 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 2 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0))), 74109#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 74100#(and (or (<= ~n~0 (+ ~front~0 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (< ~front~0 0)) (or (<= ~n~0 (+ ~front~0 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (< ~front~0 0))), 74106#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 74107#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~element~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 74098#(and (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (<= ~n~0 ~front~0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (< ~front~0 0))), 74111#(and (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1)) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12)))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 (+ ~back~0 2)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1))) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 12))) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 8)) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 (+ ~back~0 2)) (<= ~n~0 (+ 3 ~front~0)) (< ~front~0 0))), 74112#(and (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= ~sum~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= (+ (* ~front~0 4) 4) (+ ~queue~0.offset (* ~back~0 4))) (< (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 8)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~queue~0.offset 0) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (= (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 8)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (<= ~n~0 ~back~0)) (or (< ~back~0 0) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (= ~element~0 1) (< (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 8)) (<= ~n~0 ~back~0))), 74102#(and (or (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0) (<= 0 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))))) (or (<= (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 8)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset 4))) 0) (<= ~n~0 (+ 2 ~front~0)) (< ~front~0 0))), 74116#(and (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 12)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~element~0 1) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (= ~sum~0 0) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (< (* ~n~0 4) (+ ~queue~0.offset (* ~back~0 4) 12)) (= (* ~front~0 4) (+ ~queue~0.offset (* ~back~0 4))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)))) (or (< ~back~0 0) (<= ~n~0 (+ ~back~0 1)) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1) 0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4) 4)) 1)) (not (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0)) (= ~queue~0.offset 0)))] [2022-03-15 19:22:26,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-03-15 19:22:26,835 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:22:26,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-03-15 19:22:26,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=5466, Unknown=0, NotChecked=0, Total=6006 [2022-03-15 19:22:26,836 INFO L87 Difference]: Start difference. First operand 989 states and 2944 transitions. Second operand has 43 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 42 states have internal predecessors, (88), 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) [2022-03-15 19:22:31,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:22:31,518 INFO L93 Difference]: Finished difference Result 1836 states and 5318 transitions. [2022-03-15 19:22:31,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-15 19:22:31,518 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 42 states have internal predecessors, (88), 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) Word has length 32 [2022-03-15 19:22:31,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:22:31,522 INFO L225 Difference]: With dead ends: 1836 [2022-03-15 19:22:31,523 INFO L226 Difference]: Without dead ends: 1811 [2022-03-15 19:22:31,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2738 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=956, Invalid=10174, Unknown=0, NotChecked=0, Total=11130 [2022-03-15 19:22:31,524 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 181 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 1467 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 1565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:22:31,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 11 Invalid, 1565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1467 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 19:22:31,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2022-03-15 19:22:31,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 997. [2022-03-15 19:22:31,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 997 states, 996 states have (on average 2.9759036144578315) internal successors, (2964), 996 states have internal predecessors, (2964), 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) [2022-03-15 19:22:31,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 2964 transitions. [2022-03-15 19:22:31,541 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 2964 transitions. Word has length 32 [2022-03-15 19:22:31,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:22:31,541 INFO L470 AbstractCegarLoop]: Abstraction has 997 states and 2964 transitions. [2022-03-15 19:22:31,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 42 states have internal predecessors, (88), 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) [2022-03-15 19:22:31,541 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 2964 transitions. [2022-03-15 19:22:31,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:22:31,542 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:22:31,543 INFO L514 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:22:31,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-03-15 19:22:31,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-03-15 19:22:31,755 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:22:31,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:22:31,756 INFO L85 PathProgramCache]: Analyzing trace with hash -2090608691, now seen corresponding path program 42 times [2022-03-15 19:22:31,757 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:22:31,757 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064290515] [2022-03-15 19:22:31,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:22:31,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:22:31,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2022-03-15 19:22:32,224 WARN L244 SmtUtils]: Removed 8 from assertion stack [2022-03-15 19:22:32,226 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-03-15 19:22:32,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-03-15 19:22:32,226 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 6,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 29 for 11ms.. [2022-03-15 19:22:32,227 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-03-15 19:22:32,227 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-03-15 19:22:32,228 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 [2022-03-15 19:22:32,228 INFO L732 BasicCegarLoop]: Path program histogram: [42, 1, 1, 1] [2022-03-15 19:22:32,230 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 19:22:32,230 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 19:22:32,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 07:22:32 BasicIcfg [2022-03-15 19:22:32,231 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 19:22:32,231 INFO L158 Benchmark]: Toolchain (without parser) took 766322.58ms. Allocated memory was 180.4MB in the beginning and 830.5MB in the end (delta: 650.1MB). Free memory was 125.9MB in the beginning and 622.4MB in the end (delta: -496.4MB). Peak memory consumption was 154.7MB. Max. memory is 8.0GB. [2022-03-15 19:22:32,231 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 180.4MB. Free memory is still 142.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 19:22:32,231 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.61ms. Allocated memory is still 180.4MB. Free memory was 125.7MB in the beginning and 152.0MB in the end (delta: -26.3MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. [2022-03-15 19:22:32,231 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.79ms. Allocated memory is still 180.4MB. Free memory was 152.0MB in the beginning and 150.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:22:32,231 INFO L158 Benchmark]: Boogie Preprocessor took 32.23ms. Allocated memory is still 180.4MB. Free memory was 150.2MB in the beginning and 148.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 19:22:32,231 INFO L158 Benchmark]: RCFGBuilder took 343.81ms. Allocated memory is still 180.4MB. Free memory was 148.4MB in the beginning and 131.0MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-03-15 19:22:32,231 INFO L158 Benchmark]: TraceAbstraction took 765690.14ms. Allocated memory was 180.4MB in the beginning and 830.5MB in the end (delta: 650.1MB). Free memory was 130.6MB in the beginning and 622.4MB in the end (delta: -491.8MB). Peak memory consumption was 158.7MB. Max. memory is 8.0GB. [2022-03-15 19:22:32,232 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.11ms. Allocated memory is still 180.4MB. Free memory is still 142.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 211.61ms. Allocated memory is still 180.4MB. Free memory was 125.7MB in the beginning and 152.0MB in the end (delta: -26.3MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.79ms. Allocated memory is still 180.4MB. Free memory was 152.0MB in the beginning and 150.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.23ms. Allocated memory is still 180.4MB. Free memory was 150.2MB in the beginning and 148.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 343.81ms. Allocated memory is still 180.4MB. Free memory was 148.4MB in the beginning and 131.0MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 765690.14ms. Allocated memory was 180.4MB in the beginning and 830.5MB in the end (delta: 650.1MB). Free memory was 130.6MB in the beginning and 622.4MB in the end (delta: -491.8MB). Peak memory consumption was 158.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 138 PlacesBefore, 25 PlacesAfterwards, 142 TransitionsBefore, 21 TransitionsAfterwards, 1292 CoEnabledTransitionPairs, 7 FixpointIterations, 80 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 13 TrivialYvCompositions, 10 ConcurrentYvCompositions, 8 ChoiceCompositions, 145 TotalNumberOfCompositions, 1382 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1270, positive: 1242, positive conditional: 0, positive unconditional: 1242, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 738, positive: 729, positive conditional: 0, positive unconditional: 729, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1270, positive: 513, positive conditional: 0, positive unconditional: 513, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 738, unknown conditional: 0, unknown unconditional: 738] , Statistics on independence cache: Total cache size (in pairs): 29, Positive cache size: 27, Positive conditional cache size: 0, Positive unconditional cache size: 27, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 6,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 29 for 11ms.. - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 6,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 29 for 11ms.. - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 6,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 29 for 11ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 168 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 765.6s, OverallIterations: 45, TraceHistogramMax: 8, PathProgramHistogramMax: 42, EmptinessCheckTime: 0.0s, AutomataDifference: 276.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8000 SdHoareTripleChecker+Valid, 49.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8000 mSDsluCounter, 520 SdHoareTripleChecker+Invalid, 43.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16595 mSDsCounter, 3867 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 59586 IncrementalHoareTripleChecker+Invalid, 63453 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3867 mSolverCounterUnsat, 49 mSDtfsCounter, 59586 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5387 GetRequests, 1657 SyntacticMatches, 168 SemanticMatches, 3562 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145526 ImplicationChecksByTransitivity, 438.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=997occurred in iteration=44, InterpolantAutomatonStates: 1784, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 44 MinimizatonAttempts, 16316 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 4.5s SatisfiabilityAnalysisTime, 239.4s InterpolantComputationTime, 2221 NumberOfCodeBlocks, 2218 NumberOfCodeBlocksAsserted, 144 NumberOfCheckSat, 3167 ConstructedInterpolants, 77 QuantifiedInterpolants, 114719 SizeOfPredicates, 1199 NumberOfNonLiveVariables, 9549 ConjunctsInSsa, 2018 ConjunctsInUnsatCore, 122 InterpolantComputations, 5 PerfectInterpolantSequences, 743/3477 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