./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 791161d1 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-?-791161d [2022-07-22 21:13:25,294 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 21:13:25,296 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 21:13:25,324 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 21:13:25,324 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 21:13:25,326 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 21:13:25,327 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 21:13:25,337 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 21:13:25,340 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 21:13:25,341 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 21:13:25,342 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 21:13:25,344 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 21:13:25,344 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 21:13:25,345 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 21:13:25,346 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 21:13:25,347 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 21:13:25,348 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 21:13:25,354 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 21:13:25,358 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 21:13:25,361 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 21:13:25,366 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 21:13:25,367 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 21:13:25,369 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 21:13:25,370 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 21:13:25,371 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 21:13:25,374 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 21:13:25,376 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 21:13:25,377 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 21:13:25,378 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 21:13:25,378 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 21:13:25,380 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 21:13:25,380 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 21:13:25,382 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 21:13:25,382 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 21:13:25,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 21:13:25,384 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 21:13:25,384 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 21:13:25,385 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 21:13:25,385 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 21:13:25,385 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 21:13:25,386 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 21:13:25,388 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 21:13:25,389 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 21:13:25,430 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 21:13:25,431 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 21:13:25,431 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 21:13:25,431 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 21:13:25,432 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 21:13:25,432 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 21:13:25,433 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 21:13:25,433 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 21:13:25,433 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 21:13:25,434 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 21:13:25,435 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 21:13:25,435 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 21:13:25,435 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 21:13:25,435 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 21:13:25,435 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 21:13:25,436 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 21:13:25,436 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 21:13:25,436 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 21:13:25,436 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 21:13:25,436 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 21:13:25,436 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 21:13:25,437 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 21:13:25,437 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 21:13:25,437 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 21:13:25,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 21:13:25,438 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 21:13:25,438 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 21:13:25,438 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 21:13:25,438 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 21:13:25,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 21:13:25,439 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 21:13:25,439 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 21:13:25,439 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 21:13:25,439 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-22 21:13:25,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 21:13:25,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 21:13:25,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 21:13:25,750 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 21:13:25,751 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 21:13:25,752 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-22 21:13:25,817 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/632e1fd63/aac8238340c341fda629fc2183fcfd7a/FLAG77c289d7b [2022-07-22 21:13:26,291 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 21:13:26,292 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_ok_longer.i [2022-07-22 21:13:26,315 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/632e1fd63/aac8238340c341fda629fc2183fcfd7a/FLAG77c289d7b [2022-07-22 21:13:26,619 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/632e1fd63/aac8238340c341fda629fc2183fcfd7a [2022-07-22 21:13:26,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 21:13:26,622 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 21:13:26,624 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 21:13:26,624 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 21:13:26,629 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 21:13:26,630 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:13:26" (1/1) ... [2022-07-22 21:13:26,631 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5febabaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:13:26, skipping insertion in model container [2022-07-22 21:13:26,631 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:13:26" (1/1) ... [2022-07-22 21:13:26,641 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 21:13:26,677 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 21:13:27,066 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-22 21:13:27,073 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-22 21:13:27,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 21:13:27,088 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 21:13:27,121 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-22 21:13:27,124 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-22 21:13:27,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 21:13:27,178 INFO L208 MainTranslator]: Completed translation [2022-07-22 21:13:27,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:13:27 WrapperNode [2022-07-22 21:13:27,178 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 21:13:27,179 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 21:13:27,180 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 21:13:27,180 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 21:13:27,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:13:27" (1/1) ... [2022-07-22 21:13:27,206 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:13:27" (1/1) ... [2022-07-22 21:13:27,233 INFO L137 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 204 [2022-07-22 21:13:27,233 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 21:13:27,234 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 21:13:27,234 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 21:13:27,234 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 21:13:27,252 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:13:27" (1/1) ... [2022-07-22 21:13:27,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:13:27" (1/1) ... [2022-07-22 21:13:27,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:13:27" (1/1) ... [2022-07-22 21:13:27,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:13:27" (1/1) ... [2022-07-22 21:13:27,266 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:13:27" (1/1) ... [2022-07-22 21:13:27,270 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:13:27" (1/1) ... [2022-07-22 21:13:27,272 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:13:27" (1/1) ... [2022-07-22 21:13:27,276 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 21:13:27,277 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 21:13:27,277 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 21:13:27,277 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 21:13:27,278 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:13:27" (1/1) ... [2022-07-22 21:13:27,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 21:13:27,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:13:27,326 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-22 21:13:27,335 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-22 21:13:27,358 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-07-22 21:13:27,358 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-07-22 21:13:27,358 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-07-22 21:13:27,359 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-07-22 21:13:27,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 21:13:27,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 21:13:27,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 21:13:27,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 21:13:27,359 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-07-22 21:13:27,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 21:13:27,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 21:13:27,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 21:13:27,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 21:13:27,361 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-22 21:13:27,487 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 21:13:27,488 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 21:13:27,781 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 21:13:27,791 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 21:13:27,791 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 21:13:27,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:13:27 BoogieIcfgContainer [2022-07-22 21:13:27,794 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 21:13:27,796 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 21:13:27,797 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 21:13:27,802 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 21:13:27,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 09:13:26" (1/3) ... [2022-07-22 21:13:27,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25efc4c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:13:27, skipping insertion in model container [2022-07-22 21:13:27,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:13:27" (2/3) ... [2022-07-22 21:13:27,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25efc4c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:13:27, skipping insertion in model container [2022-07-22 21:13:27,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:13:27" (3/3) ... [2022-07-22 21:13:27,805 INFO L111 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2022-07-22 21:13:27,810 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-22 21:13:27,820 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 21:13:27,821 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-22 21:13:27,821 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-22 21:13:27,898 INFO L135 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 21:13:27,933 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 225 places, 231 transitions, 478 flow [2022-07-22 21:13:27,998 INFO L129 PetriNetUnfolder]: 13/229 cut-off events. [2022-07-22 21:13:27,999 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 21:13:28,011 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-22 21:13:28,011 INFO L82 GeneralOperation]: Start removeDead. Operand has 225 places, 231 transitions, 478 flow [2022-07-22 21:13:28,018 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 213 places, 219 transitions, 447 flow [2022-07-22 21:13:28,027 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 21:13:28,034 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@3a668ff0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2ba46e32 [2022-07-22 21:13:28,035 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-07-22 21:13:28,046 INFO L129 PetriNetUnfolder]: 1/64 cut-off events. [2022-07-22 21:13:28,046 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-22 21:13:28,047 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:13:28,047 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-22 21:13:28,048 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-22 21:13:28,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:13:28,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1145000913, now seen corresponding path program 1 times [2022-07-22 21:13:28,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:13:28,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750044132] [2022-07-22 21:13:28,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:13:28,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:13:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:13:28,353 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-22 21:13:28,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:13:28,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750044132] [2022-07-22 21:13:28,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750044132] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:13:28,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:13:28,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 21:13:28,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430205621] [2022-07-22 21:13:28,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:13:28,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 21:13:28,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:13:28,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 21:13:28,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 21:13:28,395 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 231 [2022-07-22 21:13:28,400 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-22 21:13:28,400 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:13:28,400 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 231 [2022-07-22 21:13:28,402 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:13:28,477 INFO L129 PetriNetUnfolder]: 9/210 cut-off events. [2022-07-22 21:13:28,477 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-07-22 21:13:28,488 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-22 21:13:28,491 INFO L132 encePairwiseOnDemand]: 227/231 looper letters, 3 selfloop transitions, 0 changer transitions 0/210 dead transitions. [2022-07-22 21:13:28,491 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 210 transitions, 435 flow [2022-07-22 21:13:28,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 21:13:28,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-22 21:13:28,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 447 transitions. [2022-07-22 21:13:28,513 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9675324675324676 [2022-07-22 21:13:28,514 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 447 transitions. [2022-07-22 21:13:28,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 447 transitions. [2022-07-22 21:13:28,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:13:28,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 447 transitions. [2022-07-22 21:13:28,527 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-22 21:13:28,534 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-22 21:13:28,534 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-22 21:13:28,536 INFO L186 Difference]: Start difference. First operand has 213 places, 219 transitions, 447 flow. Second operand 2 states and 447 transitions. [2022-07-22 21:13:28,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 210 transitions, 435 flow [2022-07-22 21:13:28,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 210 transitions, 430 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-22 21:13:28,548 INFO L242 Difference]: Finished difference. Result has 206 places, 210 transitions, 424 flow [2022-07-22 21:13:28,550 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-22 21:13:28,563 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, -7 predicate places. [2022-07-22 21:13:28,564 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 210 transitions, 424 flow [2022-07-22 21:13:28,565 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-22 21:13:28,565 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:13:28,566 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-22 21:13:28,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 21:13:28,566 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-22 21:13:28,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:13:28,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1194749697, now seen corresponding path program 1 times [2022-07-22 21:13:28,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:13:28,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764275914] [2022-07-22 21:13:28,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:13:28,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:13:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:13:28,910 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-22 21:13:28,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:13:28,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764275914] [2022-07-22 21:13:28,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764275914] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:13:28,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:13:28,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-22 21:13:28,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935071729] [2022-07-22 21:13:28,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:13:28,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-22 21:13:28,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:13:28,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 21:13:28,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-22 21:13:28,918 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 231 [2022-07-22 21:13:28,921 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-22 21:13:28,921 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:13:28,921 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 231 [2022-07-22 21:13:28,921 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:13:29,660 INFO L129 PetriNetUnfolder]: 611/2582 cut-off events. [2022-07-22 21:13:29,660 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-07-22 21:13:29,669 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-22 21:13:29,681 INFO L132 encePairwiseOnDemand]: 218/231 looper letters, 42 selfloop transitions, 12 changer transitions 0/206 dead transitions. [2022-07-22 21:13:29,681 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 206 transitions, 524 flow [2022-07-22 21:13:29,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 21:13:29,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-22 21:13:29,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2213 transitions. [2022-07-22 21:13:29,688 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.736929736929737 [2022-07-22 21:13:29,689 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2213 transitions. [2022-07-22 21:13:29,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2213 transitions. [2022-07-22 21:13:29,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:13:29,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2213 transitions. [2022-07-22 21:13:29,713 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-22 21:13:29,721 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-22 21:13:29,723 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-22 21:13:29,724 INFO L186 Difference]: Start difference. First operand has 206 places, 210 transitions, 424 flow. Second operand 13 states and 2213 transitions. [2022-07-22 21:13:29,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 206 transitions, 524 flow [2022-07-22 21:13:29,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 206 transitions, 524 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-22 21:13:29,735 INFO L242 Difference]: Finished difference. Result has 215 places, 206 transitions, 440 flow [2022-07-22 21:13:29,736 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-22 21:13:29,737 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, 2 predicate places. [2022-07-22 21:13:29,737 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 206 transitions, 440 flow [2022-07-22 21:13:29,739 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-22 21:13:29,740 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:13:29,740 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-22 21:13:29,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 21:13:29,741 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-22 21:13:29,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:13:29,743 INFO L85 PathProgramCache]: Analyzing trace with hash -933293975, now seen corresponding path program 1 times [2022-07-22 21:13:29,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:13:29,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010050661] [2022-07-22 21:13:29,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:13:29,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:13:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:13:29,857 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-22 21:13:29,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:13:29,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010050661] [2022-07-22 21:13:29,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010050661] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:13:29,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:13:29,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 21:13:29,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524918516] [2022-07-22 21:13:29,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:13:29,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 21:13:29,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:13:29,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 21:13:29,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 21:13:29,863 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 231 [2022-07-22 21:13:29,864 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-22 21:13:29,864 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:13:29,864 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 231 [2022-07-22 21:13:29,864 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:13:29,904 INFO L129 PetriNetUnfolder]: 16/307 cut-off events. [2022-07-22 21:13:29,905 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-07-22 21:13:29,905 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-22 21:13:29,907 INFO L132 encePairwiseOnDemand]: 227/231 looper letters, 7 selfloop transitions, 2 changer transitions 5/209 dead transitions. [2022-07-22 21:13:29,907 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 209 transitions, 473 flow [2022-07-22 21:13:29,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 21:13:29,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-22 21:13:29,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 655 transitions. [2022-07-22 21:13:29,909 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9451659451659452 [2022-07-22 21:13:29,909 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 655 transitions. [2022-07-22 21:13:29,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 655 transitions. [2022-07-22 21:13:29,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:13:29,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 655 transitions. [2022-07-22 21:13:29,912 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-22 21:13:29,913 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-22 21:13:29,914 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-22 21:13:29,914 INFO L186 Difference]: Start difference. First operand has 215 places, 206 transitions, 440 flow. Second operand 3 states and 655 transitions. [2022-07-22 21:13:29,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 209 transitions, 473 flow [2022-07-22 21:13:29,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 209 transitions, 450 flow, removed 0 selfloop flow, removed 11 redundant places. [2022-07-22 21:13:29,919 INFO L242 Difference]: Finished difference. Result has 207 places, 203 transitions, 419 flow [2022-07-22 21:13:29,920 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-22 21:13:29,921 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, -6 predicate places. [2022-07-22 21:13:29,921 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 203 transitions, 419 flow [2022-07-22 21:13:29,921 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-22 21:13:29,922 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:13:29,922 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-22 21:13:29,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 21:13:29,922 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-22 21:13:29,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:13:29,923 INFO L85 PathProgramCache]: Analyzing trace with hash 464408434, now seen corresponding path program 1 times [2022-07-22 21:13:29,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:13:29,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291719766] [2022-07-22 21:13:29,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:13:29,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:13:29,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:13:30,069 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-22 21:13:30,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:13:30,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291719766] [2022-07-22 21:13:30,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291719766] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:13:30,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:13:30,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 21:13:30,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463092803] [2022-07-22 21:13:30,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:13:30,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 21:13:30,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:13:30,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 21:13:30,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 21:13:30,077 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 231 [2022-07-22 21:13:30,078 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-22 21:13:30,079 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:13:30,080 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 231 [2022-07-22 21:13:30,080 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:13:30,130 INFO L129 PetriNetUnfolder]: 20/336 cut-off events. [2022-07-22 21:13:30,130 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 21:13:30,131 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-22 21:13:30,133 INFO L132 encePairwiseOnDemand]: 228/231 looper letters, 13 selfloop transitions, 2 changer transitions 1/208 dead transitions. [2022-07-22 21:13:30,133 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 208 transitions, 461 flow [2022-07-22 21:13:30,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 21:13:30,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-22 21:13:30,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 655 transitions. [2022-07-22 21:13:30,136 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9451659451659452 [2022-07-22 21:13:30,136 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 655 transitions. [2022-07-22 21:13:30,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 655 transitions. [2022-07-22 21:13:30,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:13:30,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 655 transitions. [2022-07-22 21:13:30,143 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-22 21:13:30,144 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-22 21:13:30,145 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-22 21:13:30,145 INFO L186 Difference]: Start difference. First operand has 207 places, 203 transitions, 419 flow. Second operand 3 states and 655 transitions. [2022-07-22 21:13:30,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 208 transitions, 461 flow [2022-07-22 21:13:30,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 208 transitions, 457 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-22 21:13:30,150 INFO L242 Difference]: Finished difference. Result has 207 places, 203 transitions, 425 flow [2022-07-22 21:13:30,151 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-22 21:13:30,152 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, -6 predicate places. [2022-07-22 21:13:30,157 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 203 transitions, 425 flow [2022-07-22 21:13:30,158 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-22 21:13:30,158 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:13:30,158 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-22 21:13:30,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 21:13:30,159 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-22 21:13:30,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:13:30,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1789731816, now seen corresponding path program 1 times [2022-07-22 21:13:30,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:13:30,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473173498] [2022-07-22 21:13:30,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:13:30,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:13:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:13:30,285 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-22 21:13:30,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:13:30,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473173498] [2022-07-22 21:13:30,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473173498] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:13:30,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774164187] [2022-07-22 21:13:30,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:13:30,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:13:30,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:13:30,289 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-22 21:13:30,290 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-22 21:13:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:13:30,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 21:13:30,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:13:30,523 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-22 21:13:30,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:13:30,609 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-22 21:13:30,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774164187] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:13:30,610 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:13:30,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-07-22 21:13:30,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102709745] [2022-07-22 21:13:30,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:13:30,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 21:13:30,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:13:30,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 21:13:30,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-22 21:13:30,617 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2022-07-22 21:13:30,620 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-22 21:13:30,620 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:13:30,620 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2022-07-22 21:13:30,621 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:13:30,788 INFO L129 PetriNetUnfolder]: 30/423 cut-off events. [2022-07-22 21:13:30,789 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-07-22 21:13:30,790 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-22 21:13:30,792 INFO L132 encePairwiseOnDemand]: 225/231 looper letters, 20 selfloop transitions, 9 changer transitions 0/220 dead transitions. [2022-07-22 21:13:30,792 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 220 transitions, 533 flow [2022-07-22 21:13:30,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 21:13:30,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-22 21:13:30,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1939 transitions. [2022-07-22 21:13:30,797 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9326599326599326 [2022-07-22 21:13:30,797 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1939 transitions. [2022-07-22 21:13:30,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1939 transitions. [2022-07-22 21:13:30,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:13:30,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1939 transitions. [2022-07-22 21:13:30,803 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-22 21:13:30,807 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-22 21:13:30,808 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-22 21:13:30,808 INFO L186 Difference]: Start difference. First operand has 207 places, 203 transitions, 425 flow. Second operand 9 states and 1939 transitions. [2022-07-22 21:13:30,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 220 transitions, 533 flow [2022-07-22 21:13:30,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 220 transitions, 531 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-22 21:13:30,822 INFO L242 Difference]: Finished difference. Result has 216 places, 209 transitions, 473 flow [2022-07-22 21:13:30,823 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-22 21:13:30,825 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, 3 predicate places. [2022-07-22 21:13:30,825 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 209 transitions, 473 flow [2022-07-22 21:13:30,828 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-22 21:13:30,828 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:13:30,829 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-22 21:13:30,859 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-22 21:13:31,043 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-22 21:13:31,044 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-22 21:13:31,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:13:31,045 INFO L85 PathProgramCache]: Analyzing trace with hash -146638564, now seen corresponding path program 2 times [2022-07-22 21:13:31,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:13:31,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553221373] [2022-07-22 21:13:31,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:13:31,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:13:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:13:31,181 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-22 21:13:31,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:13:31,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553221373] [2022-07-22 21:13:31,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553221373] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:13:31,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:13:31,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 21:13:31,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462465158] [2022-07-22 21:13:31,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:13:31,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 21:13:31,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:13:31,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 21:13:31,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 21:13:31,188 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 231 [2022-07-22 21:13:31,188 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-22 21:13:31,189 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:13:31,189 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 231 [2022-07-22 21:13:31,189 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:13:31,277 INFO L129 PetriNetUnfolder]: 25/611 cut-off events. [2022-07-22 21:13:31,278 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-07-22 21:13:31,279 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-22 21:13:31,281 INFO L132 encePairwiseOnDemand]: 227/231 looper letters, 12 selfloop transitions, 3 changer transitions 3/211 dead transitions. [2022-07-22 21:13:31,281 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 211 transitions, 512 flow [2022-07-22 21:13:31,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 21:13:31,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-22 21:13:31,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 645 transitions. [2022-07-22 21:13:31,284 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9307359307359307 [2022-07-22 21:13:31,284 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 645 transitions. [2022-07-22 21:13:31,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 645 transitions. [2022-07-22 21:13:31,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:13:31,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 645 transitions. [2022-07-22 21:13:31,286 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-22 21:13:31,288 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-22 21:13:31,288 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-22 21:13:31,288 INFO L186 Difference]: Start difference. First operand has 216 places, 209 transitions, 473 flow. Second operand 3 states and 645 transitions. [2022-07-22 21:13:31,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 211 transitions, 512 flow [2022-07-22 21:13:31,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 211 transitions, 506 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-07-22 21:13:31,296 INFO L242 Difference]: Finished difference. Result has 217 places, 206 transitions, 467 flow [2022-07-22 21:13:31,296 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-22 21:13:31,299 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, 4 predicate places. [2022-07-22 21:13:31,301 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 206 transitions, 467 flow [2022-07-22 21:13:31,301 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-22 21:13:31,302 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:13:31,302 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-22 21:13:31,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 21:13:31,303 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-22 21:13:31,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:13:31,304 INFO L85 PathProgramCache]: Analyzing trace with hash -733343356, now seen corresponding path program 1 times [2022-07-22 21:13:31,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:13:31,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668619978] [2022-07-22 21:13:31,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:13:31,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:13:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:13:31,485 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-22 21:13:31,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:13:31,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668619978] [2022-07-22 21:13:31,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668619978] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:13:31,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254452440] [2022-07-22 21:13:31,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:13:31,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:13:31,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:13:31,488 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-22 21:13:31,489 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-22 21:13:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:13:31,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 21:13:31,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:13:31,814 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-22 21:13:31,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:13:32,016 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-22 21:13:32,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254452440] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:13:32,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:13:32,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-07-22 21:13:32,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395643673] [2022-07-22 21:13:32,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:13:32,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-22 21:13:32,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:13:32,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-22 21:13:32,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-07-22 21:13:32,024 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2022-07-22 21:13:32,028 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-22 21:13:32,029 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:13:32,029 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2022-07-22 21:13:32,029 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:13:32,348 INFO L129 PetriNetUnfolder]: 58/747 cut-off events. [2022-07-22 21:13:32,348 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2022-07-22 21:13:32,350 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-22 21:13:32,353 INFO L132 encePairwiseOnDemand]: 225/231 looper letters, 40 selfloop transitions, 21 changer transitions 1/249 dead transitions. [2022-07-22 21:13:32,353 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 249 transitions, 765 flow [2022-07-22 21:13:32,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-22 21:13:32,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-07-22 21:13:32,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4517 transitions. [2022-07-22 21:13:32,362 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9311482168625026 [2022-07-22 21:13:32,362 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 4517 transitions. [2022-07-22 21:13:32,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 4517 transitions. [2022-07-22 21:13:32,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:13:32,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 4517 transitions. [2022-07-22 21:13:32,374 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-22 21:13:32,383 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-22 21:13:32,385 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-22 21:13:32,386 INFO L186 Difference]: Start difference. First operand has 217 places, 206 transitions, 467 flow. Second operand 21 states and 4517 transitions. [2022-07-22 21:13:32,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 249 transitions, 765 flow [2022-07-22 21:13:32,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 249 transitions, 762 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-22 21:13:32,392 INFO L242 Difference]: Finished difference. Result has 238 places, 218 transitions, 592 flow [2022-07-22 21:13:32,392 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-22 21:13:32,393 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, 25 predicate places. [2022-07-22 21:13:32,393 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 218 transitions, 592 flow [2022-07-22 21:13:32,395 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-22 21:13:32,395 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:13:32,395 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-22 21:13:32,423 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-22 21:13:32,611 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-22 21:13:32,612 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-22 21:13:32,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:13:32,612 INFO L85 PathProgramCache]: Analyzing trace with hash 2142412128, now seen corresponding path program 2 times [2022-07-22 21:13:32,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:13:32,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783917456] [2022-07-22 21:13:32,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:13:32,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:13:32,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:13:32,924 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-22 21:13:32,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:13:32,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783917456] [2022-07-22 21:13:32,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783917456] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:13:32,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158026599] [2022-07-22 21:13:32,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 21:13:32,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:13:32,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:13:32,928 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-22 21:13:32,962 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-22 21:13:33,184 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 21:13:33,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 21:13:33,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-22 21:13:33,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:13:33,455 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-22 21:13:33,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:13:33,959 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-22 21:13:33,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158026599] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:13:33,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:13:33,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2022-07-22 21:13:33,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976975397] [2022-07-22 21:13:33,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:13:33,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-22 21:13:33,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:13:33,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-22 21:13:33,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2022-07-22 21:13:33,975 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2022-07-22 21:13:33,989 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-22 21:13:33,989 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:13:33,989 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2022-07-22 21:13:33,990 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:13:34,798 INFO L129 PetriNetUnfolder]: 114/1393 cut-off events. [2022-07-22 21:13:34,799 INFO L130 PetriNetUnfolder]: For 465/465 co-relation queries the response was YES. [2022-07-22 21:13:34,803 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-22 21:13:34,807 INFO L132 encePairwiseOnDemand]: 225/231 looper letters, 80 selfloop transitions, 45 changer transitions 0/312 dead transitions. [2022-07-22 21:13:34,807 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 312 transitions, 1330 flow [2022-07-22 21:13:34,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-22 21:13:34,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2022-07-22 21:13:34,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 9673 transitions. [2022-07-22 21:13:34,824 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9305435305435306 [2022-07-22 21:13:34,824 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 9673 transitions. [2022-07-22 21:13:34,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 9673 transitions. [2022-07-22 21:13:34,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:13:34,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 9673 transitions. [2022-07-22 21:13:34,845 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-22 21:13:34,862 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-22 21:13:34,865 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-22 21:13:34,866 INFO L186 Difference]: Start difference. First operand has 238 places, 218 transitions, 592 flow. Second operand 45 states and 9673 transitions. [2022-07-22 21:13:34,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 312 transitions, 1330 flow [2022-07-22 21:13:34,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 312 transitions, 1290 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-07-22 21:13:34,874 INFO L242 Difference]: Finished difference. Result has 284 places, 243 transitions, 870 flow [2022-07-22 21:13:34,875 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-22 21:13:34,876 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, 71 predicate places. [2022-07-22 21:13:34,876 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 243 transitions, 870 flow [2022-07-22 21:13:34,878 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-22 21:13:34,878 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:13:34,878 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-22 21:13:34,904 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-22 21:13:35,091 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-22 21:13:35,092 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-22 21:13:35,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:13:35,092 INFO L85 PathProgramCache]: Analyzing trace with hash 681727648, now seen corresponding path program 3 times [2022-07-22 21:13:35,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:13:35,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544073097] [2022-07-22 21:13:35,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:13:35,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:13:35,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:13:35,754 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-22 21:13:35,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:13:35,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544073097] [2022-07-22 21:13:35,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544073097] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:13:35,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422051080] [2022-07-22 21:13:35,754 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 21:13:35,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:13:35,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:13:35,760 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-22 21:13:35,786 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-22 21:13:36,115 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-22 21:13:36,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 21:13:36,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-22 21:13:36,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:13:37,769 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-22 21:13:37,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 21:13:37,840 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-22 21:13:38,053 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 21:13:38,062 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-22 21:13:38,062 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-22 21:13:38,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 21:13:38,100 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-22 21:13:38,134 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-22 21:13:38,167 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-22 21:13:38,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:13:40,519 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-22 21:13:40,539 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:13:40,539 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-22 21:13:40,547 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:13:40,548 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-22 21:13:40,552 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-22 21:13:41,327 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-22 21:13:41,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422051080] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:13:41,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:13:41,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 14, 12] total 55 [2022-07-22 21:13:41,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229960528] [2022-07-22 21:13:41,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:13:41,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-07-22 21:13:41,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:13:41,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-07-22 21:13:41,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=2489, Unknown=1, NotChecked=104, Total=2970 [2022-07-22 21:13:41,339 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 231 [2022-07-22 21:13:41,348 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-22 21:13:41,349 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:13:41,349 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 231 [2022-07-22 21:13:41,349 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:13:52,972 INFO L129 PetriNetUnfolder]: 2125/7558 cut-off events. [2022-07-22 21:13:52,972 INFO L130 PetriNetUnfolder]: For 2828/2828 co-relation queries the response was YES. [2022-07-22 21:13:53,049 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-22 21:13:53,081 INFO L132 encePairwiseOnDemand]: 208/231 looper letters, 871 selfloop transitions, 374 changer transitions 0/1379 dead transitions. [2022-07-22 21:13:53,081 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 467 places, 1379 transitions, 6634 flow [2022-07-22 21:13:53,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2022-07-22 21:13:53,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2022-07-22 21:13:53,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 30535 transitions. [2022-07-22 21:13:53,119 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7184029738377564 [2022-07-22 21:13:53,119 INFO L72 ComplementDD]: Start complementDD. Operand 184 states and 30535 transitions. [2022-07-22 21:13:53,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 184 states and 30535 transitions. [2022-07-22 21:13:53,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:13:53,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 184 states and 30535 transitions. [2022-07-22 21:13:53,178 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-22 21:13:53,265 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-22 21:13:53,286 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-22 21:13:53,287 INFO L186 Difference]: Start difference. First operand has 284 places, 243 transitions, 870 flow. Second operand 184 states and 30535 transitions. [2022-07-22 21:13:53,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 467 places, 1379 transitions, 6634 flow [2022-07-22 21:13:53,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 1379 transitions, 6519 flow, removed 22 selfloop flow, removed 18 redundant places. [2022-07-22 21:13:53,327 INFO L242 Difference]: Finished difference. Result has 518 places, 648 transitions, 3386 flow [2022-07-22 21:13:53,328 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-22 21:13:53,329 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, 305 predicate places. [2022-07-22 21:13:53,329 INFO L495 AbstractCegarLoop]: Abstraction has has 518 places, 648 transitions, 3386 flow [2022-07-22 21:13:53,332 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-22 21:13:53,332 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:13:53,333 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-22 21:13:53,371 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-22 21:13:53,551 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-22 21:13:53,552 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-22 21:13:53,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:13:53,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1852996793, now seen corresponding path program 1 times [2022-07-22 21:13:53,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:13:53,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761276013] [2022-07-22 21:13:53,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:13:53,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:13:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:13:54,318 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-22 21:13:54,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:13:54,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761276013] [2022-07-22 21:13:54,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761276013] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:13:54,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118840312] [2022-07-22 21:13:54,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:13:54,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:13:54,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:13:54,321 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-22 21:13:54,322 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-22 21:13:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:13:54,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 1380 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-22 21:13:54,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:13:55,301 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-22 21:13:55,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:13:56,671 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-22 21:13:56,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118840312] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:13:56,672 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:13:56,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 70 [2022-07-22 21:13:56,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253023757] [2022-07-22 21:13:56,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:13:56,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-07-22 21:13:56,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:13:56,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-07-22 21:13:56,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1260, Invalid=3570, Unknown=0, NotChecked=0, Total=4830 [2022-07-22 21:13:56,685 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2022-07-22 21:13:56,695 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-22 21:13:56,696 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:13:56,696 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2022-07-22 21:13:56,696 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:14:03,478 INFO L129 PetriNetUnfolder]: 927/8255 cut-off events. [2022-07-22 21:14:03,478 INFO L130 PetriNetUnfolder]: For 115970/115970 co-relation queries the response was YES. [2022-07-22 21:14:03,538 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-22 21:14:03,565 INFO L132 encePairwiseOnDemand]: 225/231 looper letters, 170 selfloop transitions, 162 changer transitions 0/873 dead transitions. [2022-07-22 21:14:03,565 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 616 places, 873 transitions, 5722 flow [2022-07-22 21:14:03,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-07-22 21:14:03,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2022-07-22 21:14:03,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 21274 transitions. [2022-07-22 21:14:03,611 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9302549302549302 [2022-07-22 21:14:03,611 INFO L72 ComplementDD]: Start complementDD. Operand 99 states and 21274 transitions. [2022-07-22 21:14:03,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 21274 transitions. [2022-07-22 21:14:03,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:14:03,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 99 states and 21274 transitions. [2022-07-22 21:14:03,654 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-22 21:14:03,678 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-22 21:14:03,684 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-22 21:14:03,685 INFO L186 Difference]: Start difference. First operand has 518 places, 648 transitions, 3386 flow. Second operand 99 states and 21274 transitions. [2022-07-22 21:14:03,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 616 places, 873 transitions, 5722 flow [2022-07-22 21:14:04,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 873 transitions, 5536 flow, removed 4 selfloop flow, removed 48 redundant places. [2022-07-22 21:14:04,030 INFO L242 Difference]: Finished difference. Result has 586 places, 715 transitions, 4470 flow [2022-07-22 21:14:04,032 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-22 21:14:04,033 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, 373 predicate places. [2022-07-22 21:14:04,033 INFO L495 AbstractCegarLoop]: Abstraction has has 586 places, 715 transitions, 4470 flow [2022-07-22 21:14:04,036 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-22 21:14:04,036 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:14:04,037 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-22 21:14:04,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-22 21:14:04,247 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-22 21:14:04,248 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-22 21:14:04,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:14:04,248 INFO L85 PathProgramCache]: Analyzing trace with hash 2115049742, now seen corresponding path program 2 times [2022-07-22 21:14:04,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:14:04,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128469387] [2022-07-22 21:14:04,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:14:04,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:14:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:14:06,169 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-22 21:14:06,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:14:06,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128469387] [2022-07-22 21:14:06,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128469387] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:14:06,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041131753] [2022-07-22 21:14:06,170 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 21:14:06,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:14:06,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:14:06,171 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-22 21:14:06,171 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-22 21:14:06,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 21:14:06,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 21:14:06,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 2513 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-22 21:14:06,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:14:07,876 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-22 21:14:07,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:14:11,979 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-22 21:14:11,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041131753] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:14:11,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:14:11,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 138 [2022-07-22 21:14:11,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929482371] [2022-07-22 21:14:11,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:14:11,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 138 states [2022-07-22 21:14:11,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:14:11,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2022-07-22 21:14:11,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4830, Invalid=14076, Unknown=0, NotChecked=0, Total=18906 [2022-07-22 21:14:12,008 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2022-07-22 21:14:12,025 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-22 21:14:12,025 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:14:12,026 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2022-07-22 21:14:12,026 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:14:37,262 INFO L129 PetriNetUnfolder]: 1811/16517 cut-off events. [2022-07-22 21:14:37,262 INFO L130 PetriNetUnfolder]: For 328970/328970 co-relation queries the response was YES. [2022-07-22 21:14:37,462 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-22 21:14:37,513 INFO L132 encePairwiseOnDemand]: 225/231 looper letters, 340 selfloop transitions, 298 changer transitions 0/1179 dead transitions. [2022-07-22 21:14:37,514 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 786 places, 1179 transitions, 9850 flow [2022-07-22 21:14:37,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2022-07-22 21:14:37,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2022-07-22 21:14:37,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 43187 transitions. [2022-07-22 21:14:37,556 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.930132885356766 [2022-07-22 21:14:37,556 INFO L72 ComplementDD]: Start complementDD. Operand 201 states and 43187 transitions. [2022-07-22 21:14:37,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 201 states and 43187 transitions. [2022-07-22 21:14:37,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:14:37,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 201 states and 43187 transitions. [2022-07-22 21:14:37,619 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-22 21:14:37,659 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-22 21:14:37,670 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-22 21:14:37,670 INFO L186 Difference]: Start difference. First operand has 586 places, 715 transitions, 4470 flow. Second operand 201 states and 43187 transitions. [2022-07-22 21:14:37,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 786 places, 1179 transitions, 9850 flow [2022-07-22 21:14:38,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 738 places, 1179 transitions, 9240 flow, removed 208 selfloop flow, removed 48 redundant places. [2022-07-22 21:14:38,322 INFO L242 Difference]: Finished difference. Result has 773 places, 852 transitions, 6798 flow [2022-07-22 21:14:38,323 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-22 21:14:38,324 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, 560 predicate places. [2022-07-22 21:14:38,324 INFO L495 AbstractCegarLoop]: Abstraction has has 773 places, 852 transitions, 6798 flow [2022-07-22 21:14:38,328 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-22 21:14:38,328 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:14:38,329 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-22 21:14:38,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-22 21:14:38,530 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-22 21:14:38,531 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-22 21:14:38,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:14:38,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1168467045, now seen corresponding path program 3 times [2022-07-22 21:14:38,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:14:38,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216947974] [2022-07-22 21:14:38,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:14:38,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:14:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:14:44,841 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-22 21:14:44,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:14:44,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216947974] [2022-07-22 21:14:44,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216947974] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:14:44,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427587236] [2022-07-22 21:14:44,842 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 21:14:44,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:14:44,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:14:44,844 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-22 21:14:44,871 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-22 21:14:45,424 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-22 21:14:45,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 21:14:45,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 73 conjunts are in the unsatisfiable core [2022-07-22 21:14:45,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:14:57,744 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-22 21:14:57,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 21:14:57,899 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-22 21:14:58,437 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 21:14:58,444 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-22 21:14:58,445 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-22 21:14:58,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 21:14:58,480 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-22 21:14:58,770 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-22 21:14:58,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 21:14:58,872 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-22 21:14:59,194 INFO L356 Elim1Store]: treesize reduction 53, result has 19.7 percent of original size [2022-07-22 21:14:59,195 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-22 21:14:59,276 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-22 21:14:59,276 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-22 21:14:59,291 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-22 21:14:59,367 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-22 21:14:59,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:14:59,954 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-22 21:14:59,984 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-22 21:14:59,990 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-22 21:14:59,998 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-22 21:15:00,011 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-22 21:15:00,025 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-22 21:15:00,047 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-22 21:15:00,090 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-22 21:15:00,108 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-22 21:15:00,142 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-22 21:15:00,190 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-22 21:15:00,292 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-22 21:15:00,364 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:15:00,365 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-22 21:15:00,375 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:15:00,376 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-22 21:15:00,385 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-22 21:15:00,390 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 21:15:00,394 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-22 21:15:00,433 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-22 21:15:00,490 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 21:15:00,491 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 195 treesize of output 183 [2022-07-22 21:15:03,340 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-22 21:15:03,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427587236] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:15:03,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:15:03,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [137, 21, 24] total 178 [2022-07-22 21:15:03,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686917675] [2022-07-22 21:15:03,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:15:03,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 178 states [2022-07-22 21:15:03,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:15:03,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2022-07-22 21:15:03,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4953, Invalid=22473, Unknown=12, NotChecked=4068, Total=31506 [2022-07-22 21:15:03,370 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 231 [2022-07-22 21:15:03,387 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-22 21:15:03,387 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:15:03,387 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 231 [2022-07-22 21:15:03,387 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:15:04,194 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-22 21:15:04,649 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-22 21:15:05,081 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-22 21:15:05,504 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-22 21:15:06,098 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-22 21:15:08,124 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-22 21:15:10,125 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-22 21:15:10,619 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-22 21:15:11,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_~#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-22 21:15:11,828 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-22 21:15:12,302 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-22 21:15:12,800 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-22 21:15:13,740 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-22 21:15:14,172 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-22 21:15:16,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_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-22 21:15:18,368 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-22 21:15:21,656 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-22 21:15:22,124 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-22 21:15:22,517 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-22 21:15:23,126 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-22 21:15:23,643 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-22 21:15:24,563 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-22 21:15:26,892 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-22 21:15:28,858 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-22 21:15:29,703 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-22 21:15:30,108 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-22 21:15:30,597 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-22 21:15:31,046 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-22 21:15:31,953 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-22 21:15:34,135 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-22 21:15:36,428 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-22 21:15:36,851 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-22 21:15:37,398 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-22 21:15:37,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-22 21:15:38,435 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-22 21:15:39,564 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-22 21:15:41,846 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-22 21:15:44,100 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-22 21:15:44,524 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-22 21:15:45,066 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-22 21:15:45,605 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-22 21:15:46,167 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-22 21:15:47,107 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-22 21:15:49,425 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-22 21:15:51,536 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-22 21:15:52,468 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-22 21:15:53,025 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-22 21:15:53,496 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-22 21:15:53,899 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-22 21:15:54,976 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-22 21:15:57,080 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-22 21:15:59,938 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-22 21:16:00,382 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-22 21:16:01,109 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-22 21:16:01,632 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-22 21:16:02,102 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-22 21:16:03,218 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-22 21:16:05,440 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-22 21:16:08,058 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-22 21:16:08,502 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-22 21:16:09,217 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-22 21:16:09,820 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-22 21:16:10,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_~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-22 21:16:11,426 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-22 21:16:13,664 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-22 21:16:15,704 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-22 21:16:16,728 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-22 21:16:17,239 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-22 21:16:17,677 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-22 21:16:18,483 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-22 21:16:19,454 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-22 21:16:21,594 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-22 21:16:24,573 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-22 21:16:25,015 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-22 21:16:25,911 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-22 21:16:26,464 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-22 21:16:27,367 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-22 21:16:28,179 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-22 21:16:30,443 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-22 21:16:33,398 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-22 21:16:33,849 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-22 21:16:34,615 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-22 21:16:35,244 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-22 21:16:36,193 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-22 21:16:36,909 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-22 21:16:39,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_~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-22 21:16:41,513 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-22 21:16:42,655 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-22 21:16:43,161 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-22 21:16:43,636 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-22 21:16:44,989 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-22 21:16:45,467 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-22 21:16:47,567 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-22 21:16:50,845 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-22 21:16:51,324 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-22 21:16:52,136 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-22 21:16:52,733 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-22 21:16:54,248 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-22 21:16:54,721 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-22 21:16:56,930 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-22 21:16:59,797 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-22 21:17:00,254 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-22 21:17:01,097 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-22 21:17:01,938 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-22 21:17:03,390 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-22 21:17:03,843 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-22 21:17:06,111 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-22 21:17:08,567 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-22 21:17:09,687 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-22 21:17:10,285 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-22 21:17:10,769 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-22 21:17:12,179 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-22 21:17:14,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_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-22 21:17:15,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_~#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-22 21:17:18,288 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-22 21:17:18,824 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-22 21:17:19,721 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-22 21:17:20,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_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-22 21:17:21,902 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-22 21:17:24,210 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-22 21:17:24,996 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