./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/queue_ok_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/queue_ok_longer.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 08:31:36,103 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 08:31:36,105 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 08:31:36,138 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 08:31:36,138 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 08:31:36,140 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 08:31:36,144 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 08:31:36,147 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 08:31:36,148 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 08:31:36,154 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 08:31:36,155 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 08:31:36,157 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 08:31:36,157 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 08:31:36,159 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 08:31:36,161 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 08:31:36,166 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 08:31:36,167 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 08:31:36,169 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 08:31:36,170 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 08:31:36,174 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 08:31:36,176 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 08:31:36,177 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 08:31:36,179 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 08:31:36,179 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 08:31:36,181 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 08:31:36,185 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 08:31:36,185 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 08:31:36,186 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 08:31:36,186 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 08:31:36,187 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 08:31:36,187 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 08:31:36,188 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 08:31:36,189 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 08:31:36,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 08:31:36,191 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 08:31:36,192 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 08:31:36,192 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 08:31:36,192 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 08:31:36,193 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 08:31:36,193 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 08:31:36,194 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 08:31:36,195 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 08:31:36,198 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 08:31:36,241 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 08:31:36,241 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 08:31:36,242 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 08:31:36,242 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 08:31:36,242 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 08:31:36,243 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 08:31:36,243 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 08:31:36,243 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 08:31:36,244 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 08:31:36,244 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 08:31:36,245 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 08:31:36,245 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 08:31:36,245 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 08:31:36,245 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 08:31:36,245 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 08:31:36,246 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 08:31:36,246 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 08:31:36,246 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 08:31:36,246 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 08:31:36,246 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 08:31:36,247 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 08:31:36,247 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 08:31:36,247 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 08:31:36,247 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 08:31:36,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 08:31:36,248 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 08:31:36,248 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 08:31:36,248 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 08:31:36,248 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 08:31:36,248 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 08:31:36,249 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 08:31:36,249 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 08:31:36,249 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 08:31:36,249 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2022-07-21 08:31:36,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 08:31:36,567 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 08:31:36,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 08:31:36,570 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 08:31:36,571 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 08:31:36,572 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue_ok_longer.i [2022-07-21 08:31:36,623 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be4fe6ffb/44caabbe13af4021ab5f548ac4436b0d/FLAG6bf04fa02 [2022-07-21 08:31:37,128 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 08:31:37,128 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_ok_longer.i [2022-07-21 08:31:37,159 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be4fe6ffb/44caabbe13af4021ab5f548ac4436b0d/FLAG6bf04fa02 [2022-07-21 08:31:37,459 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be4fe6ffb/44caabbe13af4021ab5f548ac4436b0d [2022-07-21 08:31:37,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 08:31:37,462 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 08:31:37,463 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 08:31:37,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 08:31:37,466 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 08:31:37,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 08:31:37" (1/1) ... [2022-07-21 08:31:37,468 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71e1a3d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:31:37, skipping insertion in model container [2022-07-21 08:31:37,469 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 08:31:37" (1/1) ... [2022-07-21 08:31:37,475 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 08:31:37,526 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 08:31:37,861 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-07-21 08:31:37,866 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-07-21 08:31:37,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 08:31:37,887 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 08:31:37,927 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-07-21 08:31:37,929 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-07-21 08:31:37,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 08:31:37,996 INFO L208 MainTranslator]: Completed translation [2022-07-21 08:31:37,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:31:37 WrapperNode [2022-07-21 08:31:37,997 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 08:31:37,998 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 08:31:37,998 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 08:31:37,998 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 08:31:38,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:31:37" (1/1) ... [2022-07-21 08:31:38,034 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:31:37" (1/1) ... [2022-07-21 08:31:38,078 INFO L137 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 204 [2022-07-21 08:31:38,079 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 08:31:38,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 08:31:38,080 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 08:31:38,080 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 08:31:38,086 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:31:37" (1/1) ... [2022-07-21 08:31:38,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:31:37" (1/1) ... [2022-07-21 08:31:38,104 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:31:37" (1/1) ... [2022-07-21 08:31:38,105 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:31:37" (1/1) ... [2022-07-21 08:31:38,116 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:31:37" (1/1) ... [2022-07-21 08:31:38,130 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:31:37" (1/1) ... [2022-07-21 08:31:38,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:31:37" (1/1) ... [2022-07-21 08:31:38,139 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 08:31:38,144 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 08:31:38,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 08:31:38,146 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 08:31:38,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:31:37" (1/1) ... [2022-07-21 08:31:38,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 08:31:38,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:31:38,177 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-07-21 08:31:38,202 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-07-21 08:31:38,217 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-07-21 08:31:38,218 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-07-21 08:31:38,218 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-07-21 08:31:38,218 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-07-21 08:31:38,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 08:31:38,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 08:31:38,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 08:31:38,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 08:31:38,219 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-07-21 08:31:38,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 08:31:38,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 08:31:38,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 08:31:38,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 08:31:38,220 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-21 08:31:38,350 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 08:31:38,351 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 08:31:38,733 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 08:31:38,742 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 08:31:38,742 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-21 08:31:38,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:31:38 BoogieIcfgContainer [2022-07-21 08:31:38,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 08:31:38,746 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 08:31:38,746 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 08:31:38,748 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 08:31:38,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 08:31:37" (1/3) ... [2022-07-21 08:31:38,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@831d636 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 08:31:38, skipping insertion in model container [2022-07-21 08:31:38,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:31:37" (2/3) ... [2022-07-21 08:31:38,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@831d636 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 08:31:38, skipping insertion in model container [2022-07-21 08:31:38,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:31:38" (3/3) ... [2022-07-21 08:31:38,751 INFO L111 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2022-07-21 08:31:38,755 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-21 08:31:38,763 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 08:31:38,763 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-21 08:31:38,763 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-21 08:31:38,867 INFO L135 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-21 08:31:38,912 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 225 places, 231 transitions, 478 flow [2022-07-21 08:31:39,008 INFO L129 PetriNetUnfolder]: 13/229 cut-off events. [2022-07-21 08:31:39,009 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-21 08:31:39,020 INFO L84 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 229 events. 13/229 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 365 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 146. Up to 3 conditions per place. [2022-07-21 08:31:39,021 INFO L82 GeneralOperation]: Start removeDead. Operand has 225 places, 231 transitions, 478 flow [2022-07-21 08:31:39,026 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 213 places, 219 transitions, 447 flow [2022-07-21 08:31:39,048 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 08:31:39,054 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4875e55e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@532b69f0 [2022-07-21 08:31:39,054 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-07-21 08:31:39,063 INFO L129 PetriNetUnfolder]: 1/64 cut-off events. [2022-07-21 08:31:39,063 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-21 08:31:39,063 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:31:39,064 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:31:39,064 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-21 08:31:39,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:31:39,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1145000913, now seen corresponding path program 1 times [2022-07-21 08:31:39,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:31:39,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528683854] [2022-07-21 08:31:39,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:31:39,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:31:39,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:31:39,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:31:39,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:31:39,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528683854] [2022-07-21 08:31:39,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528683854] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:31:39,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:31:39,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 08:31:39,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715687669] [2022-07-21 08:31:39,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:31:39,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 08:31:39,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:31:39,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 08:31:39,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 08:31:39,339 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 231 [2022-07-21 08:31:39,342 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 219 transitions, 447 flow. Second operand has 2 states, 2 states have (on average 220.5) internal successors, (441), 2 states have internal predecessors, (441), 0 states have call successors, (0), 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-07-21 08:31:39,343 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:31:39,343 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 231 [2022-07-21 08:31:39,344 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:31:39,402 INFO L129 PetriNetUnfolder]: 9/210 cut-off events. [2022-07-21 08:31:39,403 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-07-21 08:31:39,405 INFO L84 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 210 events. 9/210 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 276 event pairs, 0 based on Foata normal form. 5/205 useless extension candidates. Maximal degree in co-relation 143. Up to 4 conditions per place. [2022-07-21 08:31:39,407 INFO L132 encePairwiseOnDemand]: 227/231 looper letters, 3 selfloop transitions, 0 changer transitions 0/210 dead transitions. [2022-07-21 08:31:39,407 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 210 transitions, 435 flow [2022-07-21 08:31:39,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 08:31:39,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-21 08:31:39,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 447 transitions. [2022-07-21 08:31:39,421 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9675324675324676 [2022-07-21 08:31:39,421 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 447 transitions. [2022-07-21 08:31:39,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 447 transitions. [2022-07-21 08:31:39,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:31:39,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 447 transitions. [2022-07-21 08:31:39,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 223.5) internal successors, (447), 2 states have internal predecessors, (447), 0 states have call successors, (0), 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-07-21 08:31:39,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 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-07-21 08:31:39,436 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 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-07-21 08:31:39,438 INFO L186 Difference]: Start difference. First operand has 213 places, 219 transitions, 447 flow. Second operand 2 states and 447 transitions. [2022-07-21 08:31:39,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 210 transitions, 435 flow [2022-07-21 08:31:39,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 210 transitions, 430 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-21 08:31:39,446 INFO L242 Difference]: Finished difference. Result has 206 places, 210 transitions, 424 flow [2022-07-21 08:31:39,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=424, PETRI_PLACES=206, PETRI_TRANSITIONS=210} [2022-07-21 08:31:39,452 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, -7 predicate places. [2022-07-21 08:31:39,452 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 210 transitions, 424 flow [2022-07-21 08:31:39,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 220.5) internal successors, (441), 2 states have internal predecessors, (441), 0 states have call successors, (0), 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-07-21 08:31:39,453 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:31:39,453 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:31:39,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 08:31:39,454 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-21 08:31:39,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:31:39,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1194749697, now seen corresponding path program 1 times [2022-07-21 08:31:39,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:31:39,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932504388] [2022-07-21 08:31:39,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:31:39,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:31:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:31:39,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:31:39,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:31:39,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932504388] [2022-07-21 08:31:39,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932504388] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:31:39,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:31:39,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-21 08:31:39,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746666334] [2022-07-21 08:31:39,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:31:39,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 08:31:39,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:31:39,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 08:31:39,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-21 08:31:39,755 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 231 [2022-07-21 08:31:39,758 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 210 transitions, 424 flow. Second operand has 12 states, 12 states have (on average 169.25) internal successors, (2031), 12 states have internal predecessors, (2031), 0 states have call successors, (0), 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-07-21 08:31:39,759 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:31:39,759 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 231 [2022-07-21 08:31:39,759 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:31:40,519 INFO L129 PetriNetUnfolder]: 611/2582 cut-off events. [2022-07-21 08:31:40,519 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-07-21 08:31:40,528 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3514 conditions, 2582 events. 611/2582 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 20469 event pairs, 459 based on Foata normal form. 0/2410 useless extension candidates. Maximal degree in co-relation 3511. Up to 882 conditions per place. [2022-07-21 08:31:40,540 INFO L132 encePairwiseOnDemand]: 218/231 looper letters, 42 selfloop transitions, 12 changer transitions 0/206 dead transitions. [2022-07-21 08:31:40,541 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 206 transitions, 524 flow [2022-07-21 08:31:40,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 08:31:40,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-21 08:31:40,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2213 transitions. [2022-07-21 08:31:40,549 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.736929736929737 [2022-07-21 08:31:40,549 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2213 transitions. [2022-07-21 08:31:40,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2213 transitions. [2022-07-21 08:31:40,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:31:40,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2213 transitions. [2022-07-21 08:31:40,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 170.23076923076923) internal successors, (2213), 13 states have internal predecessors, (2213), 0 states have call successors, (0), 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-07-21 08:31:40,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 231.0) internal successors, (3234), 14 states have internal predecessors, (3234), 0 states have call successors, (0), 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-07-21 08:31:40,565 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 231.0) internal successors, (3234), 14 states have internal predecessors, (3234), 0 states have call successors, (0), 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-07-21 08:31:40,565 INFO L186 Difference]: Start difference. First operand has 206 places, 210 transitions, 424 flow. Second operand 13 states and 2213 transitions. [2022-07-21 08:31:40,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 206 transitions, 524 flow [2022-07-21 08:31:40,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 206 transitions, 524 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-21 08:31:40,577 INFO L242 Difference]: Finished difference. Result has 215 places, 206 transitions, 440 flow [2022-07-21 08:31:40,578 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=440, PETRI_PLACES=215, PETRI_TRANSITIONS=206} [2022-07-21 08:31:40,579 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, 2 predicate places. [2022-07-21 08:31:40,579 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 206 transitions, 440 flow [2022-07-21 08:31:40,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 169.25) internal successors, (2031), 12 states have internal predecessors, (2031), 0 states have call successors, (0), 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-07-21 08:31:40,581 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:31:40,581 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:31:40,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 08:31:40,582 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-21 08:31:40,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:31:40,583 INFO L85 PathProgramCache]: Analyzing trace with hash -933293975, now seen corresponding path program 1 times [2022-07-21 08:31:40,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:31:40,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038206004] [2022-07-21 08:31:40,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:31:40,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:31:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:31:40,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:31:40,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:31:40,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038206004] [2022-07-21 08:31:40,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038206004] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:31:40,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:31:40,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 08:31:40,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800537572] [2022-07-21 08:31:40,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:31:40,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:31:40,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:31:40,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:31:40,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 08:31:40,702 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 231 [2022-07-21 08:31:40,703 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 206 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 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-07-21 08:31:40,703 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:31:40,703 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 231 [2022-07-21 08:31:40,703 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:31:40,746 INFO L129 PetriNetUnfolder]: 16/307 cut-off events. [2022-07-21 08:31:40,746 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-07-21 08:31:40,747 INFO L84 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 307 events. 16/307 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 691 event pairs, 2 based on Foata normal form. 0/291 useless extension candidates. Maximal degree in co-relation 346. Up to 12 conditions per place. [2022-07-21 08:31:40,748 INFO L132 encePairwiseOnDemand]: 227/231 looper letters, 7 selfloop transitions, 2 changer transitions 5/209 dead transitions. [2022-07-21 08:31:40,748 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 209 transitions, 473 flow [2022-07-21 08:31:40,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:31:40,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-21 08:31:40,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 655 transitions. [2022-07-21 08:31:40,751 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9451659451659452 [2022-07-21 08:31:40,751 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 655 transitions. [2022-07-21 08:31:40,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 655 transitions. [2022-07-21 08:31:40,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:31:40,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 655 transitions. [2022-07-21 08:31:40,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 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-07-21 08:31:40,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 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-07-21 08:31:40,756 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 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-07-21 08:31:40,756 INFO L186 Difference]: Start difference. First operand has 215 places, 206 transitions, 440 flow. Second operand 3 states and 655 transitions. [2022-07-21 08:31:40,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 209 transitions, 473 flow [2022-07-21 08:31:40,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 209 transitions, 450 flow, removed 0 selfloop flow, removed 11 redundant places. [2022-07-21 08:31:40,761 INFO L242 Difference]: Finished difference. Result has 207 places, 203 transitions, 419 flow [2022-07-21 08:31:40,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=419, PETRI_PLACES=207, PETRI_TRANSITIONS=203} [2022-07-21 08:31:40,762 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, -6 predicate places. [2022-07-21 08:31:40,762 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 203 transitions, 419 flow [2022-07-21 08:31:40,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 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-07-21 08:31:40,763 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:31:40,763 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:31:40,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 08:31:40,764 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-21 08:31:40,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:31:40,764 INFO L85 PathProgramCache]: Analyzing trace with hash 464408434, now seen corresponding path program 1 times [2022-07-21 08:31:40,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:31:40,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243712835] [2022-07-21 08:31:40,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:31:40,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:31:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:31:40,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:31:40,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:31:40,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243712835] [2022-07-21 08:31:40,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243712835] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:31:40,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:31:40,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 08:31:40,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196455291] [2022-07-21 08:31:40,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:31:40,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:31:40,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:31:40,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:31:40,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 08:31:40,832 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 231 [2022-07-21 08:31:40,833 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 203 transitions, 419 flow. Second operand has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 0 states have call successors, (0), 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-07-21 08:31:40,833 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:31:40,833 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 231 [2022-07-21 08:31:40,833 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:31:40,886 INFO L129 PetriNetUnfolder]: 20/336 cut-off events. [2022-07-21 08:31:40,886 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-21 08:31:40,887 INFO L84 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 336 events. 20/336 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 668 event pairs, 6 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 401. Up to 24 conditions per place. [2022-07-21 08:31:40,889 INFO L132 encePairwiseOnDemand]: 228/231 looper letters, 13 selfloop transitions, 2 changer transitions 1/208 dead transitions. [2022-07-21 08:31:40,889 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 208 transitions, 461 flow [2022-07-21 08:31:40,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:31:40,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-21 08:31:40,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 655 transitions. [2022-07-21 08:31:40,891 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9451659451659452 [2022-07-21 08:31:40,891 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 655 transitions. [2022-07-21 08:31:40,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 655 transitions. [2022-07-21 08:31:40,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:31:40,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 655 transitions. [2022-07-21 08:31:40,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 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-07-21 08:31:40,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 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-07-21 08:31:40,917 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 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-07-21 08:31:40,918 INFO L186 Difference]: Start difference. First operand has 207 places, 203 transitions, 419 flow. Second operand 3 states and 655 transitions. [2022-07-21 08:31:40,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 208 transitions, 461 flow [2022-07-21 08:31:40,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 208 transitions, 457 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-21 08:31:40,922 INFO L242 Difference]: Finished difference. Result has 207 places, 203 transitions, 425 flow [2022-07-21 08:31:40,923 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=425, PETRI_PLACES=207, PETRI_TRANSITIONS=203} [2022-07-21 08:31:40,923 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, -6 predicate places. [2022-07-21 08:31:40,923 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 203 transitions, 425 flow [2022-07-21 08:31:40,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 0 states have call successors, (0), 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-07-21 08:31:40,924 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:31:40,924 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:31:40,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 08:31:40,925 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-21 08:31:40,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:31:40,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1789731816, now seen corresponding path program 1 times [2022-07-21 08:31:40,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:31:40,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180704845] [2022-07-21 08:31:40,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:31:40,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:31:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:31:41,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:31:41,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:31:41,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180704845] [2022-07-21 08:31:41,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180704845] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:31:41,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500815644] [2022-07-21 08:31:41,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:31:41,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:31:41,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:31:41,065 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-07-21 08:31:41,097 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-07-21 08:31:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:31:41,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 08:31:41,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:31:41,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:31:41,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 08:31:41,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:31:41,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500815644] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 08:31:41,370 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 08:31:41,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-07-21 08:31:41,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270777874] [2022-07-21 08:31:41,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 08:31:41,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 08:31:41,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:31:41,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 08:31:41,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-21 08:31:41,375 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2022-07-21 08:31:41,377 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 203 transitions, 425 flow. Second operand has 10 states, 10 states have (on average 214.2) internal successors, (2142), 10 states have internal predecessors, (2142), 0 states have call successors, (0), 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-07-21 08:31:41,377 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:31:41,377 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2022-07-21 08:31:41,377 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:31:41,493 INFO L129 PetriNetUnfolder]: 30/423 cut-off events. [2022-07-21 08:31:41,493 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-07-21 08:31:41,494 INFO L84 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 423 events. 30/423 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 684 event pairs, 4 based on Foata normal form. 4/416 useless extension candidates. Maximal degree in co-relation 537. Up to 19 conditions per place. [2022-07-21 08:31:41,496 INFO L132 encePairwiseOnDemand]: 225/231 looper letters, 20 selfloop transitions, 9 changer transitions 0/220 dead transitions. [2022-07-21 08:31:41,496 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 220 transitions, 533 flow [2022-07-21 08:31:41,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 08:31:41,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-21 08:31:41,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1939 transitions. [2022-07-21 08:31:41,500 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9326599326599326 [2022-07-21 08:31:41,501 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1939 transitions. [2022-07-21 08:31:41,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1939 transitions. [2022-07-21 08:31:41,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:31:41,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1939 transitions. [2022-07-21 08:31:41,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 215.44444444444446) internal successors, (1939), 9 states have internal predecessors, (1939), 0 states have call successors, (0), 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-07-21 08:31:41,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 231.0) internal successors, (2310), 10 states have internal predecessors, (2310), 0 states have call successors, (0), 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-07-21 08:31:41,510 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 231.0) internal successors, (2310), 10 states have internal predecessors, (2310), 0 states have call successors, (0), 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-07-21 08:31:41,510 INFO L186 Difference]: Start difference. First operand has 207 places, 203 transitions, 425 flow. Second operand 9 states and 1939 transitions. [2022-07-21 08:31:41,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 220 transitions, 533 flow [2022-07-21 08:31:41,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 220 transitions, 531 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-21 08:31:41,515 INFO L242 Difference]: Finished difference. Result has 216 places, 209 transitions, 473 flow [2022-07-21 08:31:41,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=473, PETRI_PLACES=216, PETRI_TRANSITIONS=209} [2022-07-21 08:31:41,518 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, 3 predicate places. [2022-07-21 08:31:41,518 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 209 transitions, 473 flow [2022-07-21 08:31:41,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 214.2) internal successors, (2142), 10 states have internal predecessors, (2142), 0 states have call successors, (0), 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-07-21 08:31:41,521 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:31:41,521 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:31:41,552 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-07-21 08:31:41,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:31:41,736 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-21 08:31:41,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:31:41,736 INFO L85 PathProgramCache]: Analyzing trace with hash -146638564, now seen corresponding path program 2 times [2022-07-21 08:31:41,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:31:41,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018462573] [2022-07-21 08:31:41,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:31:41,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:31:41,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:31:41,888 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-07-21 08:31:41,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:31:41,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018462573] [2022-07-21 08:31:41,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018462573] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:31:41,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:31:41,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 08:31:41,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960424208] [2022-07-21 08:31:41,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:31:41,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:31:41,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:31:41,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:31:41,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 08:31:41,899 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 231 [2022-07-21 08:31:41,900 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 209 transitions, 473 flow. Second operand has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 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-07-21 08:31:41,900 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:31:41,900 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 231 [2022-07-21 08:31:41,901 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:31:41,985 INFO L129 PetriNetUnfolder]: 25/611 cut-off events. [2022-07-21 08:31:41,985 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-07-21 08:31:41,987 INFO L84 FinitePrefix]: Finished finitePrefix Result has 733 conditions, 611 events. 25/611 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 1290 event pairs, 3 based on Foata normal form. 2/596 useless extension candidates. Maximal degree in co-relation 725. Up to 19 conditions per place. [2022-07-21 08:31:41,988 INFO L132 encePairwiseOnDemand]: 227/231 looper letters, 12 selfloop transitions, 3 changer transitions 3/211 dead transitions. [2022-07-21 08:31:41,988 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 211 transitions, 512 flow [2022-07-21 08:31:41,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:31:41,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-21 08:31:41,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 645 transitions. [2022-07-21 08:31:41,991 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9307359307359307 [2022-07-21 08:31:41,991 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 645 transitions. [2022-07-21 08:31:41,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 645 transitions. [2022-07-21 08:31:41,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:31:41,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 645 transitions. [2022-07-21 08:31:41,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 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-07-21 08:31:41,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 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-07-21 08:31:41,995 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 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-07-21 08:31:41,995 INFO L186 Difference]: Start difference. First operand has 216 places, 209 transitions, 473 flow. Second operand 3 states and 645 transitions. [2022-07-21 08:31:41,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 211 transitions, 512 flow [2022-07-21 08:31:41,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 211 transitions, 506 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-07-21 08:31:42,002 INFO L242 Difference]: Finished difference. Result has 217 places, 206 transitions, 467 flow [2022-07-21 08:31:42,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=467, PETRI_PLACES=217, PETRI_TRANSITIONS=206} [2022-07-21 08:31:42,005 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, 4 predicate places. [2022-07-21 08:31:42,008 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 206 transitions, 467 flow [2022-07-21 08:31:42,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 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-07-21 08:31:42,008 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:31:42,008 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:31:42,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 08:31:42,010 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-21 08:31:42,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:31:42,010 INFO L85 PathProgramCache]: Analyzing trace with hash -733343356, now seen corresponding path program 1 times [2022-07-21 08:31:42,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:31:42,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359047752] [2022-07-21 08:31:42,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:31:42,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:31:42,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:31:42,166 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:31:42,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:31:42,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359047752] [2022-07-21 08:31:42,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359047752] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:31:42,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321477875] [2022-07-21 08:31:42,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:31:42,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:31:42,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:31:42,169 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-07-21 08:31:42,170 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-07-21 08:31:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:31:42,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 08:31:42,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:31:42,481 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:31:42,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 08:31:42,683 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:31:42,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321477875] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 08:31:42,684 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 08:31:42,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-07-21 08:31:42,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894995165] [2022-07-21 08:31:42,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 08:31:42,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-21 08:31:42,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:31:42,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-21 08:31:42,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-07-21 08:31:42,689 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2022-07-21 08:31:42,693 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 206 transitions, 467 flow. Second operand has 18 states, 18 states have (on average 214.33333333333334) internal successors, (3858), 18 states have internal predecessors, (3858), 0 states have call successors, (0), 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-07-21 08:31:42,693 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:31:42,693 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2022-07-21 08:31:42,693 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:31:42,980 INFO L129 PetriNetUnfolder]: 58/747 cut-off events. [2022-07-21 08:31:42,981 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2022-07-21 08:31:42,983 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 747 events. 58/747 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1398 event pairs, 4 based on Foata normal form. 8/736 useless extension candidates. Maximal degree in co-relation 1047. Up to 39 conditions per place. [2022-07-21 08:31:42,985 INFO L132 encePairwiseOnDemand]: 225/231 looper letters, 40 selfloop transitions, 21 changer transitions 1/249 dead transitions. [2022-07-21 08:31:42,985 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 249 transitions, 765 flow [2022-07-21 08:31:42,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-21 08:31:42,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-07-21 08:31:42,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4517 transitions. [2022-07-21 08:31:42,993 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9311482168625026 [2022-07-21 08:31:42,993 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 4517 transitions. [2022-07-21 08:31:42,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 4517 transitions. [2022-07-21 08:31:42,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:31:42,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 4517 transitions. [2022-07-21 08:31:43,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 215.0952380952381) internal successors, (4517), 21 states have internal predecessors, (4517), 0 states have call successors, (0), 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-07-21 08:31:43,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 231.0) internal successors, (5082), 22 states have internal predecessors, (5082), 0 states have call successors, (0), 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-07-21 08:31:43,013 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 231.0) internal successors, (5082), 22 states have internal predecessors, (5082), 0 states have call successors, (0), 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-07-21 08:31:43,013 INFO L186 Difference]: Start difference. First operand has 217 places, 206 transitions, 467 flow. Second operand 21 states and 4517 transitions. [2022-07-21 08:31:43,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 249 transitions, 765 flow [2022-07-21 08:31:43,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 249 transitions, 762 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-21 08:31:43,039 INFO L242 Difference]: Finished difference. Result has 238 places, 218 transitions, 592 flow [2022-07-21 08:31:43,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=592, PETRI_PLACES=238, PETRI_TRANSITIONS=218} [2022-07-21 08:31:43,040 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, 25 predicate places. [2022-07-21 08:31:43,041 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 218 transitions, 592 flow [2022-07-21 08:31:43,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 214.33333333333334) internal successors, (3858), 18 states have internal predecessors, (3858), 0 states have call successors, (0), 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-07-21 08:31:43,042 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:31:43,043 INFO L200 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:31:43,070 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-07-21 08:31:43,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-07-21 08:31:43,257 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-21 08:31:43,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:31:43,258 INFO L85 PathProgramCache]: Analyzing trace with hash 2142412128, now seen corresponding path program 2 times [2022-07-21 08:31:43,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:31:43,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640419709] [2022-07-21 08:31:43,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:31:43,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:31:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:31:43,560 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:31:43,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:31:43,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640419709] [2022-07-21 08:31:43,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640419709] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:31:43,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911886108] [2022-07-21 08:31:43,561 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 08:31:43,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:31:43,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:31:43,563 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-07-21 08:31:43,571 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-07-21 08:31:43,847 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 08:31:43,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 08:31:43,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-21 08:31:43,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:31:44,126 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:31:44,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 08:31:44,568 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:31:44,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911886108] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 08:31:44,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 08:31:44,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2022-07-21 08:31:44,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83092351] [2022-07-21 08:31:44,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 08:31:44,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-21 08:31:44,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:31:44,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-21 08:31:44,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2022-07-21 08:31:44,592 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2022-07-21 08:31:44,610 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 218 transitions, 592 flow. Second operand has 34 states, 34 states have (on average 214.41176470588235) internal successors, (7290), 34 states have internal predecessors, (7290), 0 states have call successors, (0), 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-07-21 08:31:44,610 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:31:44,610 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2022-07-21 08:31:44,610 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:31:45,419 INFO L129 PetriNetUnfolder]: 114/1393 cut-off events. [2022-07-21 08:31:45,420 INFO L130 PetriNetUnfolder]: For 465/465 co-relation queries the response was YES. [2022-07-21 08:31:45,423 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2169 conditions, 1393 events. 114/1393 cut-off events. For 465/465 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 2796 event pairs, 4 based on Foata normal form. 16/1374 useless extension candidates. Maximal degree in co-relation 2155. Up to 79 conditions per place. [2022-07-21 08:31:45,427 INFO L132 encePairwiseOnDemand]: 225/231 looper letters, 80 selfloop transitions, 45 changer transitions 0/312 dead transitions. [2022-07-21 08:31:45,427 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 312 transitions, 1330 flow [2022-07-21 08:31:45,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-21 08:31:45,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2022-07-21 08:31:45,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 9673 transitions. [2022-07-21 08:31:45,444 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9305435305435306 [2022-07-21 08:31:45,445 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 9673 transitions. [2022-07-21 08:31:45,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 9673 transitions. [2022-07-21 08:31:45,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:31:45,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 9673 transitions. [2022-07-21 08:31:45,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 214.95555555555555) internal successors, (9673), 45 states have internal predecessors, (9673), 0 states have call successors, (0), 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-07-21 08:31:45,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 231.0) internal successors, (10626), 46 states have internal predecessors, (10626), 0 states have call successors, (0), 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-07-21 08:31:45,483 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 231.0) internal successors, (10626), 46 states have internal predecessors, (10626), 0 states have call successors, (0), 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-07-21 08:31:45,483 INFO L186 Difference]: Start difference. First operand has 238 places, 218 transitions, 592 flow. Second operand 45 states and 9673 transitions. [2022-07-21 08:31:45,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 312 transitions, 1330 flow [2022-07-21 08:31:45,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 312 transitions, 1290 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-07-21 08:31:45,492 INFO L242 Difference]: Finished difference. Result has 284 places, 243 transitions, 870 flow [2022-07-21 08:31:45,492 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=870, PETRI_PLACES=284, PETRI_TRANSITIONS=243} [2022-07-21 08:31:45,494 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, 71 predicate places. [2022-07-21 08:31:45,494 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 243 transitions, 870 flow [2022-07-21 08:31:45,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 214.41176470588235) internal successors, (7290), 34 states have internal predecessors, (7290), 0 states have call successors, (0), 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-07-21 08:31:45,496 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:31:45,497 INFO L200 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:31:45,527 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-07-21 08:31:45,723 WARN L477 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-07-21 08:31:45,724 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-21 08:31:45,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:31:45,724 INFO L85 PathProgramCache]: Analyzing trace with hash 681727648, now seen corresponding path program 3 times [2022-07-21 08:31:45,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:31:45,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373089139] [2022-07-21 08:31:45,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:31:45,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:31:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:31:46,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 0 proven. 3270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:31:46,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:31:46,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373089139] [2022-07-21 08:31:46,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373089139] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:31:46,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784206032] [2022-07-21 08:31:46,454 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 08:31:46,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:31:46,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:31:46,457 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-07-21 08:31:46,492 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-07-21 08:31:46,789 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-21 08:31:46,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 08:31:46,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-21 08:31:46,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:31:48,331 INFO L390 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-07-21 08:31:48,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 08:31:48,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 08:31:48,613 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 08:31:48,624 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-21 08:31:48,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-07-21 08:31:48,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 08:31:48,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-21 08:31:48,693 INFO L390 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 19 treesize of output 7 [2022-07-21 08:31:48,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 455 proven. 319 refuted. 0 times theorem prover too weak. 2496 trivial. 0 not checked. [2022-07-21 08:31:48,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 08:31:50,996 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_775 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 400)) is different from false [2022-07-21 08:31:51,018 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 08:31:51,019 INFO L390 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 22 treesize of output 23 [2022-07-21 08:31:51,030 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 08:31:51,030 INFO L390 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 36 treesize of output 39 [2022-07-21 08:31:51,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 08:31:51,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 377 proven. 319 refuted. 0 times theorem prover too weak. 2496 trivial. 78 not checked. [2022-07-21 08:31:51,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784206032] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 08:31:51,831 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 08:31:51,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 14, 12] total 55 [2022-07-21 08:31:51,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226534587] [2022-07-21 08:31:51,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 08:31:51,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-07-21 08:31:51,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:31:51,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-07-21 08:31:51,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=2489, Unknown=1, NotChecked=104, Total=2970 [2022-07-21 08:31:51,840 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 231 [2022-07-21 08:31:51,846 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 243 transitions, 870 flow. Second operand has 55 states, 55 states have (on average 166.74545454545455) internal successors, (9171), 55 states have internal predecessors, (9171), 0 states have call successors, (0), 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-07-21 08:31:51,846 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:31:51,846 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 231 [2022-07-21 08:31:51,846 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:32:03,095 INFO L129 PetriNetUnfolder]: 2125/7558 cut-off events. [2022-07-21 08:32:03,096 INFO L130 PetriNetUnfolder]: For 2828/2828 co-relation queries the response was YES. [2022-07-21 08:32:03,120 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15819 conditions, 7558 events. 2125/7558 cut-off events. For 2828/2828 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 40026 event pairs, 31 based on Foata normal form. 8/7466 useless extension candidates. Maximal degree in co-relation 15796. Up to 687 conditions per place. [2022-07-21 08:32:03,148 INFO L132 encePairwiseOnDemand]: 208/231 looper letters, 871 selfloop transitions, 374 changer transitions 0/1379 dead transitions. [2022-07-21 08:32:03,148 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 467 places, 1379 transitions, 6634 flow [2022-07-21 08:32:03,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2022-07-21 08:32:03,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2022-07-21 08:32:03,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 30535 transitions. [2022-07-21 08:32:03,192 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7184029738377564 [2022-07-21 08:32:03,193 INFO L72 ComplementDD]: Start complementDD. Operand 184 states and 30535 transitions. [2022-07-21 08:32:03,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 184 states and 30535 transitions. [2022-07-21 08:32:03,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:32:03,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 184 states and 30535 transitions. [2022-07-21 08:32:03,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 185 states, 184 states have (on average 165.95108695652175) internal successors, (30535), 184 states have internal predecessors, (30535), 0 states have call successors, (0), 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-07-21 08:32:03,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 185 states, 185 states have (on average 231.0) internal successors, (42735), 185 states have internal predecessors, (42735), 0 states have call successors, (0), 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-07-21 08:32:03,331 INFO L81 ComplementDD]: Finished complementDD. Result has 185 states, 185 states have (on average 231.0) internal successors, (42735), 185 states have internal predecessors, (42735), 0 states have call successors, (0), 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-07-21 08:32:03,332 INFO L186 Difference]: Start difference. First operand has 284 places, 243 transitions, 870 flow. Second operand 184 states and 30535 transitions. [2022-07-21 08:32:03,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 467 places, 1379 transitions, 6634 flow [2022-07-21 08:32:03,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 1379 transitions, 6519 flow, removed 22 selfloop flow, removed 18 redundant places. [2022-07-21 08:32:03,366 INFO L242 Difference]: Finished difference. Result has 518 places, 648 transitions, 3386 flow [2022-07-21 08:32:03,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=184, PETRI_FLOW=3386, PETRI_PLACES=518, PETRI_TRANSITIONS=648} [2022-07-21 08:32:03,368 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, 305 predicate places. [2022-07-21 08:32:03,368 INFO L495 AbstractCegarLoop]: Abstraction has has 518 places, 648 transitions, 3386 flow [2022-07-21 08:32:03,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 166.74545454545455) internal successors, (9171), 55 states have internal predecessors, (9171), 0 states have call successors, (0), 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-07-21 08:32:03,370 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:32:03,371 INFO L200 CegarLoopForPetriNet]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:32:03,400 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-07-21 08:32:03,583 WARN L477 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-07-21 08:32:03,584 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-21 08:32:03,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:32:03,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1852996793, now seen corresponding path program 1 times [2022-07-21 08:32:03,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:32:03,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130620859] [2022-07-21 08:32:03,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:32:03,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:32:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:32:04,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3694 backedges. 0 proven. 3694 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:32:04,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:32:04,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130620859] [2022-07-21 08:32:04,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130620859] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:32:04,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641066900] [2022-07-21 08:32:04,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:32:04,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:32:04,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:32:04,328 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-07-21 08:32:04,355 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-07-21 08:32:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:32:04,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 1380 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-21 08:32:04,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:32:05,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3694 backedges. 0 proven. 3694 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:32:05,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 08:32:06,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3694 backedges. 0 proven. 3694 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:32:06,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641066900] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 08:32:06,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 08:32:06,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 70 [2022-07-21 08:32:06,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19958457] [2022-07-21 08:32:06,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 08:32:06,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-07-21 08:32:06,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:32:06,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-07-21 08:32:06,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1260, Invalid=3570, Unknown=0, NotChecked=0, Total=4830 [2022-07-21 08:32:06,695 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2022-07-21 08:32:06,707 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 518 places, 648 transitions, 3386 flow. Second operand has 70 states, 70 states have (on average 214.4857142857143) internal successors, (15014), 70 states have internal predecessors, (15014), 0 states have call successors, (0), 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-07-21 08:32:06,707 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:32:06,707 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2022-07-21 08:32:06,708 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:32:12,375 INFO L129 PetriNetUnfolder]: 927/8255 cut-off events. [2022-07-21 08:32:12,376 INFO L130 PetriNetUnfolder]: For 115970/115970 co-relation queries the response was YES. [2022-07-21 08:32:12,434 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26432 conditions, 8255 events. 927/8255 cut-off events. For 115970/115970 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 37448 event pairs, 7 based on Foata normal form. 102/8349 useless extension candidates. Maximal degree in co-relation 26339. Up to 590 conditions per place. [2022-07-21 08:32:12,458 INFO L132 encePairwiseOnDemand]: 225/231 looper letters, 170 selfloop transitions, 162 changer transitions 0/873 dead transitions. [2022-07-21 08:32:12,459 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 616 places, 873 transitions, 5722 flow [2022-07-21 08:32:12,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-07-21 08:32:12,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2022-07-21 08:32:12,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 21274 transitions. [2022-07-21 08:32:12,480 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9302549302549302 [2022-07-21 08:32:12,480 INFO L72 ComplementDD]: Start complementDD. Operand 99 states and 21274 transitions. [2022-07-21 08:32:12,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 21274 transitions. [2022-07-21 08:32:12,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:32:12,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 99 states and 21274 transitions. [2022-07-21 08:32:12,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 100 states, 99 states have (on average 214.88888888888889) internal successors, (21274), 99 states have internal predecessors, (21274), 0 states have call successors, (0), 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-07-21 08:32:12,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 100 states, 100 states have (on average 231.0) internal successors, (23100), 100 states have internal predecessors, (23100), 0 states have call successors, (0), 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-07-21 08:32:12,543 INFO L81 ComplementDD]: Finished complementDD. Result has 100 states, 100 states have (on average 231.0) internal successors, (23100), 100 states have internal predecessors, (23100), 0 states have call successors, (0), 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-07-21 08:32:12,543 INFO L186 Difference]: Start difference. First operand has 518 places, 648 transitions, 3386 flow. Second operand 99 states and 21274 transitions. [2022-07-21 08:32:12,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 616 places, 873 transitions, 5722 flow [2022-07-21 08:32:12,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 873 transitions, 5536 flow, removed 4 selfloop flow, removed 48 redundant places. [2022-07-21 08:32:12,915 INFO L242 Difference]: Finished difference. Result has 586 places, 715 transitions, 4470 flow [2022-07-21 08:32:12,916 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=3200, PETRI_DIFFERENCE_MINUEND_PLACES=470, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=648, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=99, PETRI_FLOW=4470, PETRI_PLACES=586, PETRI_TRANSITIONS=715} [2022-07-21 08:32:12,917 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, 373 predicate places. [2022-07-21 08:32:12,917 INFO L495 AbstractCegarLoop]: Abstraction has has 586 places, 715 transitions, 4470 flow [2022-07-21 08:32:12,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 214.4857142857143) internal successors, (15014), 70 states have internal predecessors, (15014), 0 states have call successors, (0), 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-07-21 08:32:12,919 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:32:12,920 INFO L200 CegarLoopForPetriNet]: trace histogram [33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:32:12,971 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-07-21 08:32:13,131 WARN L477 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-07-21 08:32:13,132 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-21 08:32:13,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:32:13,133 INFO L85 PathProgramCache]: Analyzing trace with hash 2115049742, now seen corresponding path program 2 times [2022-07-21 08:32:13,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:32:13,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137876002] [2022-07-21 08:32:13,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:32:13,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:32:13,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:32:15,197 INFO L134 CoverageAnalysis]: Checked inductivity of 16337 backedges. 0 proven. 16337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:32:15,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:32:15,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137876002] [2022-07-21 08:32:15,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137876002] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:32:15,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940706913] [2022-07-21 08:32:15,198 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 08:32:15,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:32:15,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:32:15,199 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-07-21 08:32:15,199 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-07-21 08:32:15,758 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 08:32:15,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 08:32:15,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 2513 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-21 08:32:15,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:32:16,913 INFO L134 CoverageAnalysis]: Checked inductivity of 16337 backedges. 0 proven. 16337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:32:16,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 08:32:20,845 INFO L134 CoverageAnalysis]: Checked inductivity of 16337 backedges. 0 proven. 16337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:32:20,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940706913] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 08:32:20,846 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 08:32:20,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 138 [2022-07-21 08:32:20,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191061293] [2022-07-21 08:32:20,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 08:32:20,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 138 states [2022-07-21 08:32:20,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:32:20,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2022-07-21 08:32:20,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4830, Invalid=14076, Unknown=0, NotChecked=0, Total=18906 [2022-07-21 08:32:20,878 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2022-07-21 08:32:20,898 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 586 places, 715 transitions, 4470 flow. Second operand has 138 states, 138 states have (on average 214.47826086956522) internal successors, (29598), 138 states have internal predecessors, (29598), 0 states have call successors, (0), 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-07-21 08:32:20,899 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:32:20,899 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2022-07-21 08:32:20,899 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:32:42,474 INFO L129 PetriNetUnfolder]: 1811/16517 cut-off events. [2022-07-21 08:32:42,474 INFO L130 PetriNetUnfolder]: For 328970/328970 co-relation queries the response was YES. [2022-07-21 08:32:42,584 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55497 conditions, 16517 events. 1811/16517 cut-off events. For 328970/328970 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 75751 event pairs, 7 based on Foata normal form. 204/16713 useless extension candidates. Maximal degree in co-relation 55387. Up to 1474 conditions per place. [2022-07-21 08:32:42,632 INFO L132 encePairwiseOnDemand]: 225/231 looper letters, 340 selfloop transitions, 298 changer transitions 0/1179 dead transitions. [2022-07-21 08:32:42,632 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 786 places, 1179 transitions, 9850 flow [2022-07-21 08:32:42,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2022-07-21 08:32:42,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2022-07-21 08:32:42,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 43187 transitions. [2022-07-21 08:32:42,664 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.930132885356766 [2022-07-21 08:32:42,664 INFO L72 ComplementDD]: Start complementDD. Operand 201 states and 43187 transitions. [2022-07-21 08:32:42,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 201 states and 43187 transitions. [2022-07-21 08:32:42,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:32:42,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 201 states and 43187 transitions. [2022-07-21 08:32:42,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 202 states, 201 states have (on average 214.86069651741295) internal successors, (43187), 201 states have internal predecessors, (43187), 0 states have call successors, (0), 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-07-21 08:32:42,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 202 states, 202 states have (on average 231.0) internal successors, (46662), 202 states have internal predecessors, (46662), 0 states have call successors, (0), 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-07-21 08:32:42,781 INFO L81 ComplementDD]: Finished complementDD. Result has 202 states, 202 states have (on average 231.0) internal successors, (46662), 202 states have internal predecessors, (46662), 0 states have call successors, (0), 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-07-21 08:32:42,781 INFO L186 Difference]: Start difference. First operand has 586 places, 715 transitions, 4470 flow. Second operand 201 states and 43187 transitions. [2022-07-21 08:32:42,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 786 places, 1179 transitions, 9850 flow [2022-07-21 08:32:43,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 738 places, 1179 transitions, 9240 flow, removed 208 selfloop flow, removed 48 redundant places. [2022-07-21 08:32:43,406 INFO L242 Difference]: Finished difference. Result has 773 places, 852 transitions, 6798 flow [2022-07-21 08:32:43,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=4132, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=715, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=201, PETRI_FLOW=6798, PETRI_PLACES=773, PETRI_TRANSITIONS=852} [2022-07-21 08:32:43,407 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, 560 predicate places. [2022-07-21 08:32:43,407 INFO L495 AbstractCegarLoop]: Abstraction has has 773 places, 852 transitions, 6798 flow [2022-07-21 08:32:43,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 138 states, 138 states have (on average 214.47826086956522) internal successors, (29598), 138 states have internal predecessors, (29598), 0 states have call successors, (0), 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-07-21 08:32:43,410 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:32:43,411 INFO L200 CegarLoopForPetriNet]: trace histogram [67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 34, 34, 34, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:32:43,431 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-07-21 08:32:43,612 WARN L477 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-07-21 08:32:43,615 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-21 08:32:43,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:32:43,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1168467045, now seen corresponding path program 3 times [2022-07-21 08:32:43,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:32:43,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638850331] [2022-07-21 08:32:43,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:32:43,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:32:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:32:49,554 INFO L134 CoverageAnalysis]: Checked inductivity of 68476 backedges. 0 proven. 68476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:32:49,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:32:49,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638850331] [2022-07-21 08:32:49,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638850331] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:32:49,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677249913] [2022-07-21 08:32:49,555 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 08:32:49,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:32:49,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:32:49,560 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-07-21 08:32:49,564 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-07-21 08:32:50,248 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-21 08:32:50,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 08:32:50,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 73 conjunts are in the unsatisfiable core [2022-07-21 08:32:50,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:32:58,969 INFO L390 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-07-21 08:32:59,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 08:32:59,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 08:32:59,438 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 08:32:59,446 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-21 08:32:59,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-07-21 08:32:59,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 08:32:59,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-21 08:32:59,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-07-21 08:32:59,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 08:32:59,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 08:33:00,317 INFO L356 Elim1Store]: treesize reduction 53, result has 19.7 percent of original size [2022-07-21 08:33:00,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 30 [2022-07-21 08:33:00,414 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-21 08:33:00,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-21 08:33:00,436 INFO L390 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 19 treesize of output 7 [2022-07-21 08:33:00,513 INFO L134 CoverageAnalysis]: Checked inductivity of 68476 backedges. 4139 proven. 1521 refuted. 0 times theorem prover too weak. 62816 trivial. 0 not checked. [2022-07-21 08:33:00,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 08:33:01,060 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse1))))) is different from false [2022-07-21 08:33:01,102 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1))))) is different from false [2022-07-21 08:33:01,110 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse1))))) is different from false [2022-07-21 08:33:01,122 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse1))))) is different from false [2022-07-21 08:33:01,136 WARN L833 $PredicateComparison]: unable to prove that (or (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse1)))))) is different from false [2022-07-21 08:33:01,146 WARN L833 $PredicateComparison]: unable to prove that (or (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse1)))))) is different from false [2022-07-21 08:33:01,171 WARN L833 $PredicateComparison]: unable to prove that (or (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2809 Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse1)))))) is different from false [2022-07-21 08:33:01,216 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_2815)) .cse2)) 400)))))) is different from false [2022-07-21 08:33:01,235 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) is different from false [2022-07-21 08:33:01,272 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) is different from false [2022-07-21 08:33:01,338 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) is different from false [2022-07-21 08:33:01,468 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) is different from false [2022-07-21 08:33:01,565 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 08:33:01,566 INFO L390 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 234 treesize of output 164 [2022-07-21 08:33:01,577 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 08:33:01,578 INFO L390 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 266 treesize of output 262 [2022-07-21 08:33:01,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 204 [2022-07-21 08:33:01,596 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 08:33:01,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 348 treesize of output 328 [2022-07-21 08:33:02,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-21 08:33:02,063 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 08:33:02,064 INFO L390 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 222 treesize of output 210 [2022-07-21 08:33:05,124 INFO L134 CoverageAnalysis]: Checked inductivity of 68476 backedges. 1687 proven. 1492 refuted. 0 times theorem prover too weak. 62816 trivial. 2481 not checked. [2022-07-21 08:33:05,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677249913] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 08:33:05,125 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 08:33:05,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [137, 21, 24] total 178 [2022-07-21 08:33:05,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269336400] [2022-07-21 08:33:05,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 08:33:05,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 178 states [2022-07-21 08:33:05,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:33:05,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2022-07-21 08:33:05,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4953, Invalid=22473, Unknown=12, NotChecked=4068, Total=31506 [2022-07-21 08:33:05,153 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 231 [2022-07-21 08:33:05,166 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 773 places, 852 transitions, 6798 flow. Second operand has 178 states, 178 states have (on average 164.41573033707866) internal successors, (29266), 178 states have internal predecessors, (29266), 0 states have call successors, (0), 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-07-21 08:33:05,167 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:33:05,167 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 231 [2022-07-21 08:33:05,167 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:33:06,008 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork0_~i~0#1| 0) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:06,476 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork0_~i~0#1| 0) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:06,921 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_#t~post50#1| 0) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:07,395 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 1)) is different from false [2022-07-21 08:33:07,967 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 1)) is different from false [2022-07-21 08:33:10,008 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 1)) is different from false [2022-07-21 08:33:11,924 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 1)) is different from false [2022-07-21 08:33:12,325 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:12,792 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 1)) is different from false [2022-07-21 08:33:13,413 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:13,900 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:14,386 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 2) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:15,204 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 2) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:15,667 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:17,864 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 2) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:19,880 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:23,338 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 2) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:23,876 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 2) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:24,331 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 2) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:25,034 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 2) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:25,582 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 3) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:26,512 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 3) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:28,827 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 3) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:30,592 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 3) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:31,471 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 3) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:31,897 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 3) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:32,399 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 3) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:32,856 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:33,765 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:35,936 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:38,439 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:38,879 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:39,415 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:39,928 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 4) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:40,474 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:41,438 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:43,716 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:46,090 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:46,539 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:47,122 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:47,746 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 5) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:48,306 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:49,314 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:51,648 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:53,646 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:54,543 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:55,095 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 6) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:55,560 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 7)) is different from false [2022-07-21 08:33:55,955 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:33:57,094 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 7)) is different from false [2022-07-21 08:33:59,183 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 7)) is different from false [2022-07-21 08:34:01,812 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 7)) is different from false [2022-07-21 08:34:02,244 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 7)) is different from false [2022-07-21 08:34:02,944 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 7)) is different from false [2022-07-21 08:34:03,487 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_t1Thread1of1ForFork0_~i~0#1| 8) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:34:03,933 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 7)) is different from false [2022-07-21 08:34:05,104 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_t1Thread1of1ForFork0_~i~0#1| 8) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:34:07,303 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_t1Thread1of1ForFork0_~i~0#1| 8) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:34:09,730 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_t1Thread1of1ForFork0_~i~0#1| 8) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:34:10,175 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_t1Thread1of1ForFork0_~i~0#1| 8) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:34:10,904 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 8) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:34:11,543 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 9) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:34:11,955 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_t1Thread1of1ForFork0_~i~0#1| 8) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:34:13,151 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 9) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:34:15,373 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 9) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:34:17,364 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 9) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:34:18,420 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 9) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:34:18,949 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 9) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:34:19,571 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_t1Thread1of1ForFork0_~i~0#1| 10) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:34:20,359 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 9) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:34:21,225 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 10) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:34:23,374 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 10) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:34:26,249 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 10) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:34:26,765 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 10) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:34:27,552 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 10) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:34:28,131 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 11) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:34:28,997 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 10) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:34:29,825 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 11) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:34:32,072 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 11) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:34:34,942 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 11) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:34:35,397 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 11) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:34:36,160 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 11) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:34:36,759 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 12) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:34:37,663 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 11) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:34:38,359 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 12) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:34:40,616 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 12) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:34:42,835 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 12) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:34:43,954 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 12) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:34:44,474 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 12) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:34:44,948 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 13)) is different from false [2022-07-21 08:34:46,211 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 13)) is different from false [2022-07-21 08:34:46,641 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 12) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:34:48,730 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 13)) is different from false [2022-07-21 08:34:51,967 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 13)) is different from false [2022-07-21 08:34:52,530 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 13)) is different from false [2022-07-21 08:34:53,320 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 13) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:34:53,912 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_t1Thread1of1ForFork0_~i~0#1| 14) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:34:55,396 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 14) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:34:55,877 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6) (<= |c_t1Thread1of1ForFork0_~i~0#1| 13)) is different from false [2022-07-21 08:34:58,084 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 14) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:35:00,965 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 14) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:35:01,480 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 14) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:35:02,330 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 14) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:35:03,347 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 15) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:35:05,054 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 15) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:35:05,530 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 14) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:35:07,920 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 15) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:35:10,207 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 15) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:35:11,313 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 15) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:35:11,916 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 15) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:35:12,393 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 16) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:35:13,775 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 16) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:35:16,036 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 16) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:35:16,893 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 15) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:35:19,745 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 16) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:35:20,227 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 16) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:35:21,140 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 16) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:35:21,894 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_t1Thread1of1ForFork0_~i~0#1| 17) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:35:23,311 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 17) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:35:25,610 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 17) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:35:26,353 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 16) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:35:29,330 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 17) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:35:29,792 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 17) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:35:30,705 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (<= |c_t1Thread1of1ForFork0_#t~post50#1| 17) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:35:31,389 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2))) (or (= 400 .cse0) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse4 .cse2)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 18) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:35:32,715 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2807)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2809) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2815)) .cse1)))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse5 .cse3)))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 18) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:35:35,183 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)))) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (v_ArrVal_2809 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2807)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (not (= 400 (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2809) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2)))))))))) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 18) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-07-21 08:35:35,973 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)) 1) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 17) (forall ((v_ArrVal_2813 (Array Int Int)) (v_ArrVal_2815 Int) (v_ArrVal_2807 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2809 Int) (v_ArrVal_2806 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2806))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2807)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 400) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse1 .cse2))) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2809) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2813) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2815)) .cse2))))))))) (= 7 |c_~#queue~0.base|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| |c_~#queue~0.offset|) (<= |c_~#stored_elements~0.base| 6)) is different from false