/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-MCRwithDepranks-Lazy-NoForkJoinOpt.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-02 00:48:22,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-02 00:48:22,495 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-02 00:48:22,540 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-02 00:48:22,541 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-02 00:48:22,544 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-02 00:48:22,549 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-02 00:48:22,554 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-02 00:48:22,556 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-02 00:48:22,557 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-02 00:48:22,557 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-02 00:48:22,558 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-02 00:48:22,559 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-02 00:48:22,560 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-02 00:48:22,560 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-02 00:48:22,561 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-02 00:48:22,562 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-02 00:48:22,564 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-02 00:48:22,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-02 00:48:22,574 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-02 00:48:22,579 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-02 00:48:22,585 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-02 00:48:22,586 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-02 00:48:22,586 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-02 00:48:22,588 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-02 00:48:22,589 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-02 00:48:22,589 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-02 00:48:22,590 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-02 00:48:22,590 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-02 00:48:22,591 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-02 00:48:22,591 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-02 00:48:22,592 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-02 00:48:22,592 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-02 00:48:22,593 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-02 00:48:22,593 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-02 00:48:22,594 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-02 00:48:22,594 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-02 00:48:22,594 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-02 00:48:22,595 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-02 00:48:22,599 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-02 00:48:22,601 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-02 00:48:22,602 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-MCRwithDepranks-Lazy-NoForkJoinOpt.epf [2022-03-02 00:48:22,626 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-02 00:48:22,627 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-02 00:48:22,627 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-02 00:48:22,627 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-02 00:48:22,628 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-02 00:48:22,628 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-02 00:48:22,628 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-02 00:48:22,628 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-02 00:48:22,628 INFO L138 SettingsManager]: * Use SBE=true [2022-03-02 00:48:22,629 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-02 00:48:22,629 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-02 00:48:22,629 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-02 00:48:22,629 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-02 00:48:22,629 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-02 00:48:22,629 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-02 00:48:22,629 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-02 00:48:22,629 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-02 00:48:22,630 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-02 00:48:22,630 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-02 00:48:22,630 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-02 00:48:22,630 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-02 00:48:22,630 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-02 00:48:22,630 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-02 00:48:22,630 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-02 00:48:22,630 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-02 00:48:22,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-02 00:48:22,631 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-02 00:48:22,631 INFO L138 SettingsManager]: * Construct finite automaton lazily=true [2022-03-02 00:48:22,633 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-02 00:48:22,633 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-02 00:48:22,634 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-02 00:48:22,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-02 00:48:22,634 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-02 00:48:22,634 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-03-02 00:48:22,634 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-02 00:48:22,634 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=MCR_WITH_DEPRANKS [2022-03-02 00:48:22,635 INFO L138 SettingsManager]: * MCR: Optimize fork and join=false [2022-03-02 00:48:22,635 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 [2022-03-02 00:48:22,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-02 00:48:22,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-02 00:48:22,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-02 00:48:22,905 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-02 00:48:22,907 INFO L275 PluginConnector]: CDTParser initialized [2022-03-02 00:48:22,908 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2022-03-02 00:48:22,981 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/098a2c7be/14e988166aa34419b21fc41cd15dfd2d/FLAGc24e47b69 [2022-03-02 00:48:23,492 INFO L306 CDTParser]: Found 1 translation units. [2022-03-02 00:48:23,492 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2022-03-02 00:48:23,511 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/098a2c7be/14e988166aa34419b21fc41cd15dfd2d/FLAGc24e47b69 [2022-03-02 00:48:23,811 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/098a2c7be/14e988166aa34419b21fc41cd15dfd2d [2022-03-02 00:48:23,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-02 00:48:23,815 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-02 00:48:23,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-02 00:48:23,837 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-02 00:48:23,839 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-02 00:48:23,840 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.03 12:48:23" (1/1) ... [2022-03-02 00:48:23,842 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76b10401 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 12:48:23, skipping insertion in model container [2022-03-02 00:48:23,842 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.03 12:48:23" (1/1) ... [2022-03-02 00:48:23,848 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-02 00:48:23,901 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-02 00:48:24,270 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2022-03-02 00:48:24,275 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2022-03-02 00:48:24,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-02 00:48:24,286 INFO L203 MainTranslator]: Completed pre-run [2022-03-02 00:48:24,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2022-03-02 00:48:24,321 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2022-03-02 00:48:24,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-02 00:48:24,370 INFO L208 MainTranslator]: Completed translation [2022-03-02 00:48:24,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 12:48:24 WrapperNode [2022-03-02 00:48:24,370 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-02 00:48:24,371 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-02 00:48:24,372 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-02 00:48:24,372 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-02 00:48:24,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 12:48:24" (1/1) ... [2022-03-02 00:48:24,406 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 12:48:24" (1/1) ... [2022-03-02 00:48:24,434 INFO L137 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 204 [2022-03-02 00:48:24,434 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-02 00:48:24,435 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-02 00:48:24,435 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-02 00:48:24,435 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-02 00:48:24,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 12:48:24" (1/1) ... [2022-03-02 00:48:24,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 12:48:24" (1/1) ... [2022-03-02 00:48:24,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 12:48:24" (1/1) ... [2022-03-02 00:48:24,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 12:48:24" (1/1) ... [2022-03-02 00:48:24,464 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 12:48:24" (1/1) ... [2022-03-02 00:48:24,468 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 12:48:24" (1/1) ... [2022-03-02 00:48:24,470 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 12:48:24" (1/1) ... [2022-03-02 00:48:24,485 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-02 00:48:24,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-02 00:48:24,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-02 00:48:24,486 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-02 00:48:24,489 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 12:48:24" (1/1) ... [2022-03-02 00:48:24,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-02 00:48:24,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 00:48:24,525 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-02 00:48:24,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-02 00:48:24,567 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-03-02 00:48:24,568 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-03-02 00:48:24,568 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-03-02 00:48:24,568 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-03-02 00:48:24,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-02 00:48:24,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-02 00:48:24,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-02 00:48:24,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-02 00:48:24,568 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-02 00:48:24,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-02 00:48:24,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-02 00:48:24,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-02 00:48:24,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-02 00:48:24,570 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-02 00:48:24,678 INFO L234 CfgBuilder]: Building ICFG [2022-03-02 00:48:24,679 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-02 00:48:24,979 INFO L275 CfgBuilder]: Performing block encoding [2022-03-02 00:48:24,990 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-02 00:48:24,990 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-02 00:48:24,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.03 12:48:24 BoogieIcfgContainer [2022-03-02 00:48:24,992 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-02 00:48:24,994 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-02 00:48:24,994 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-02 00:48:24,997 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-02 00:48:24,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.03 12:48:23" (1/3) ... [2022-03-02 00:48:24,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42fd1af4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.03 12:48:24, skipping insertion in model container [2022-03-02 00:48:24,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 12:48:24" (2/3) ... [2022-03-02 00:48:24,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42fd1af4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.03 12:48:24, skipping insertion in model container [2022-03-02 00:48:24,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.03 12:48:24" (3/3) ... [2022-03-02 00:48:25,000 INFO L111 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2022-03-02 00:48:25,004 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-02 00:48:25,005 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-02 00:48:25,005 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-03-02 00:48:25,005 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-02 00:48:25,075 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,075 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,075 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,076 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,076 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,076 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,076 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,076 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,077 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,077 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,077 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,077 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,077 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,078 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,078 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,078 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,079 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,079 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,079 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,079 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,080 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,080 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,080 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,080 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,081 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,081 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,081 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,081 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,082 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,082 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,082 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,083 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,083 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,083 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,083 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,083 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,083 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,083 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,084 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,084 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,084 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,084 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,084 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,084 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,085 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,085 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,085 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,085 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,085 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,085 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,099 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,099 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,100 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,100 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,100 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,100 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,100 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,100 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,100 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,101 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,101 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,101 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,101 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,101 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,101 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,101 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,102 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,102 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,102 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,102 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,102 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,102 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,103 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,103 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,103 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,103 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,103 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,103 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,104 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,104 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,104 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,104 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,104 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,104 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,105 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,106 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,106 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,106 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,106 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,107 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,107 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,107 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,107 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,107 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,107 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,107 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,108 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,108 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,108 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,108 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,108 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,108 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,109 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,109 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,109 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,109 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,109 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,110 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,110 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,110 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,110 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,110 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,110 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,110 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,110 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,111 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,111 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,111 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,111 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,111 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,111 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,112 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,112 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,112 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,112 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,112 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,112 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,113 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,113 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,113 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,113 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,113 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,113 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,113 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,114 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,114 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,114 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,114 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,114 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,114 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,114 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,115 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,115 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,121 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,121 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,121 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,121 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,123 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,123 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,123 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,133 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,133 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,133 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,134 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,134 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,134 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,135 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,135 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,135 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,135 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,135 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,135 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,136 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,136 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,136 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,136 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,136 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,136 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,136 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,136 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,137 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,137 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,138 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,138 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,138 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,138 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,138 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,138 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,138 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,138 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,139 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,139 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,139 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,139 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,139 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,139 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,140 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,140 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,140 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,140 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,141 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,141 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,141 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,141 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,141 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,142 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,142 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,142 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,142 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,142 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,142 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,143 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,143 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,143 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,147 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,147 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,147 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,148 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,148 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,148 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,148 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,149 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,150 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,152 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,157 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,157 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,158 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,158 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,158 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,158 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,158 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,158 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,158 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,159 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,159 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,159 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,159 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,159 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,159 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,160 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,160 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,160 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,160 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,160 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,160 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,160 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,161 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,161 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,161 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,161 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,161 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,161 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,161 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,162 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,162 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,162 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,162 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,162 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,162 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,162 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,162 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,162 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,163 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,163 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,163 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,163 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,163 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,163 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,163 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,164 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,164 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,164 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,165 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,165 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,165 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,165 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,165 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,165 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,165 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,165 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,166 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,166 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,166 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,166 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,166 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,166 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,166 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,166 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,167 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,167 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,177 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,177 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,177 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,178 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,178 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,178 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,178 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,178 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,178 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,178 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,178 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,178 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,178 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,179 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,179 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,179 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,183 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,183 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,183 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,184 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,184 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,184 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,184 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,184 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,184 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,184 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,184 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,184 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,185 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,185 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,185 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,185 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,185 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,185 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,185 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,186 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,186 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,186 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,186 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,186 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,186 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,186 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,186 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,187 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,187 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,187 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,187 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,187 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,187 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,187 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,187 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,188 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,188 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,188 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,188 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,188 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,188 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,188 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,188 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,189 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,189 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,189 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,189 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,189 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,189 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,189 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,190 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,190 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,190 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,190 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,190 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,190 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,191 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,191 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,191 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,191 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,191 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,191 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,191 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,191 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,191 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,192 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,192 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,192 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,192 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,192 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,192 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,192 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,192 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,193 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,193 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,193 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,193 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,193 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,193 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,193 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,193 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,194 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,194 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,194 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,194 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,194 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,194 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,194 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,195 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,195 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,195 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,195 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,195 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,195 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,195 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,195 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,195 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,196 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,196 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,196 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,196 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,196 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,197 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,197 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,197 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,197 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,197 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,198 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,198 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,198 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,198 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,198 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,198 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,198 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,199 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,199 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,199 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,199 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,199 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,199 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,199 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,200 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,200 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,200 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,200 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,200 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,200 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,200 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,203 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,204 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,204 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,204 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,204 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,204 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,205 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,205 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,205 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,205 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,205 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,205 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,205 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,205 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,205 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,205 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,206 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,206 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,206 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,206 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,206 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,206 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,206 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,212 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,212 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,212 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,212 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,212 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,212 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,212 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,213 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,213 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,213 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,213 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,213 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,213 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,222 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,223 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,223 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,223 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,223 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,223 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,223 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,223 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,225 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,225 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,225 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,225 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,225 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,225 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,225 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,225 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,226 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,226 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:48:25,229 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-02 00:48:25,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-03-02 00:48:25,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 00:48:25,293 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-03-02 00:48:25,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-03-02 00:48:25,347 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-02 00:48:25,352 INFO L339 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=PARTIAL_ORDER_FA, mLazyFiniteAutomaton=true, 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, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=false, mMcrOverapproximateWrwc=true [2022-03-02 00:48:25,352 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-03-02 00:48:25,404 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 62 transitions and produced 63 states. [2022-03-02 00:48:25,406 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-02 00:48:25,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 00:48:25,416 INFO L85 PathProgramCache]: Analyzing trace with hash -2068546759, now seen corresponding path program 1 times [2022-03-02 00:48:25,424 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 00:48:25,424 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001688889] [2022-03-02 00:48:25,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:48:25,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 00:48:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:48:25,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:48:25,708 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 00:48:25,709 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001688889] [2022-03-02 00:48:25,709 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001688889] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-02 00:48:25,709 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-02 00:48:25,709 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-02 00:48:25,711 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342395062] [2022-03-02 00:48:25,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-02 00:48:25,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-02 00:48:25,716 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 00:48:25,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-02 00:48:25,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-02 00:48:25,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:48:25,743 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 00:48:25,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-02 00:48:25,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:48:25,840 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 197 transitions and produced 198 states. [2022-03-02 00:48:25,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:48:25,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-02 00:48:25,841 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-02 00:48:25,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 00:48:25,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1753186365, now seen corresponding path program 1 times [2022-03-02 00:48:25,845 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 00:48:25,845 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274152448] [2022-03-02 00:48:25,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:48:25,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 00:48:25,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:48:26,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:48:26,088 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 00:48:26,089 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274152448] [2022-03-02 00:48:26,089 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274152448] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-02 00:48:26,090 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-02 00:48:26,090 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-02 00:48:26,090 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253214102] [2022-03-02 00:48:26,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-02 00:48:26,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-02 00:48:26,093 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 00:48:26,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-02 00:48:26,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-02 00:48:26,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:48:26,094 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 00:48:26,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-02 00:48:26,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:48:26,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:48:26,167 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 220 transitions and produced 212 states. [2022-03-02 00:48:26,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:48:26,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:26,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-02 00:48:26,169 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-02 00:48:26,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 00:48:26,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1422445204, now seen corresponding path program 1 times [2022-03-02 00:48:26,170 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 00:48:26,170 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233377240] [2022-03-02 00:48:26,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:48:26,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 00:48:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:48:26,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:48:26,272 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 00:48:26,272 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233377240] [2022-03-02 00:48:26,272 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233377240] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-02 00:48:26,273 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-02 00:48:26,273 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-02 00:48:26,273 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723917303] [2022-03-02 00:48:26,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-02 00:48:26,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-02 00:48:26,274 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 00:48:26,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-02 00:48:26,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-02 00:48:26,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:48:26,274 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 00:48:26,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-02 00:48:26,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:48:26,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:26,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:48:26,326 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 285 transitions and produced 246 states. [2022-03-02 00:48:26,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:48:26,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:26,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:26,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-02 00:48:26,327 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-02 00:48:26,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 00:48:26,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1078166552, now seen corresponding path program 1 times [2022-03-02 00:48:26,329 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 00:48:26,332 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134286454] [2022-03-02 00:48:26,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:48:26,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 00:48:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:48:26,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:48:26,490 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 00:48:26,490 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134286454] [2022-03-02 00:48:26,490 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134286454] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 00:48:26,491 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074105367] [2022-03-02 00:48:26,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:48:26,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 00:48:26,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 00:48:26,493 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-02 00:48:26,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-02 00:48:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:48:26,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-02 00:48:26,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 00:48:27,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:48:27,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-02 00:48:27,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:48:27,377 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074105367] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-02 00:48:27,377 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-02 00:48:27,377 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-02 00:48:27,377 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572531892] [2022-03-02 00:48:27,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-02 00:48:27,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-02 00:48:27,379 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 00:48:27,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-02 00:48:27,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-02 00:48:27,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:48:27,379 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 00:48:27,380 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-02 00:48:27,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:48:27,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:27,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:27,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:48:27,453 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 415 transitions and produced 314 states. [2022-03-02 00:48:27,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:48:27,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:27,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:27,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:48:27,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-02 00:48:27,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-02 00:48:27,672 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-02 00:48:27,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 00:48:27,672 INFO L85 PathProgramCache]: Analyzing trace with hash 2065679512, now seen corresponding path program 2 times [2022-03-02 00:48:27,672 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 00:48:27,673 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959986698] [2022-03-02 00:48:27,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:48:27,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 00:48:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:48:27,739 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-03-02 00:48:27,739 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 00:48:27,739 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959986698] [2022-03-02 00:48:27,739 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959986698] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-02 00:48:27,740 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-02 00:48:27,740 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-02 00:48:27,740 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110316631] [2022-03-02 00:48:27,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-02 00:48:27,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-02 00:48:27,741 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 00:48:27,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-02 00:48:27,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-02 00:48:27,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:48:27,742 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 00:48:27,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-02 00:48:27,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:48:27,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:27,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:27,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:48:27,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:48:27,783 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 433 transitions and produced 326 states. [2022-03-02 00:48:27,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:48:27,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:27,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:27,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:48:27,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:27,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-02 00:48:27,784 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-02 00:48:27,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 00:48:27,785 INFO L85 PathProgramCache]: Analyzing trace with hash -219255834, now seen corresponding path program 1 times [2022-03-02 00:48:27,785 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 00:48:27,785 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926224356] [2022-03-02 00:48:27,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:48:27,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 00:48:27,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:48:27,951 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:48:27,951 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 00:48:27,952 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926224356] [2022-03-02 00:48:27,954 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926224356] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 00:48:27,956 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800386837] [2022-03-02 00:48:27,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:48:27,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 00:48:27,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 00:48:27,960 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-02 00:48:27,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-02 00:48:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:48:28,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-02 00:48:28,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 00:48:28,577 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:48:28,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-02 00:48:29,022 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:48:29,023 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800386837] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-02 00:48:29,023 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-02 00:48:29,023 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-03-02 00:48:29,023 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280637912] [2022-03-02 00:48:29,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-02 00:48:29,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-02 00:48:29,024 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 00:48:29,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-02 00:48:29,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-03-02 00:48:29,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:48:29,026 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 00:48:29,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 19.72222222222222) internal successors, (355), 18 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-02 00:48:29,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:48:29,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:29,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:29,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:48:29,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:29,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:48:29,210 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 677 transitions and produced 452 states. [2022-03-02 00:48:29,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:48:29,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:29,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:29,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:48:29,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:29,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-02 00:48:29,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-02 00:48:29,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 00:48:29,435 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-02 00:48:29,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 00:48:29,435 INFO L85 PathProgramCache]: Analyzing trace with hash 2009867110, now seen corresponding path program 2 times [2022-03-02 00:48:29,435 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 00:48:29,436 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969116873] [2022-03-02 00:48:29,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:48:29,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 00:48:29,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:48:29,702 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:48:29,702 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 00:48:29,702 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969116873] [2022-03-02 00:48:29,702 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969116873] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 00:48:29,702 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612891542] [2022-03-02 00:48:29,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-02 00:48:29,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 00:48:29,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 00:48:29,704 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-02 00:48:29,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-02 00:48:29,882 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-02 00:48:29,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-02 00:48:29,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-02 00:48:29,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 00:48:30,323 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 658 trivial. 0 not checked. [2022-03-02 00:48:30,323 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-02 00:48:30,323 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612891542] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-02 00:48:30,324 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-02 00:48:30,324 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [17] total 19 [2022-03-02 00:48:30,324 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449519457] [2022-03-02 00:48:30,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-02 00:48:30,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-02 00:48:30,325 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 00:48:30,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-02 00:48:30,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2022-03-02 00:48:30,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:48:30,325 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 00:48:30,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-02 00:48:30,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:48:30,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:30,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:30,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:48:30,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:30,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-02 00:48:30,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:48:30,449 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1726 transitions and produced 1440 states. [2022-03-02 00:48:30,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:48:30,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:30,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:30,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:48:30,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:30,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-02 00:48:30,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-02 00:48:30,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-02 00:48:30,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 00:48:30,668 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-02 00:48:30,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 00:48:30,668 INFO L85 PathProgramCache]: Analyzing trace with hash -353511241, now seen corresponding path program 1 times [2022-03-02 00:48:30,668 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 00:48:30,668 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113433988] [2022-03-02 00:48:30,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:48:30,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 00:48:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:48:31,121 INFO L134 CoverageAnalysis]: Checked inductivity of 5341 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 4683 trivial. 0 not checked. [2022-03-02 00:48:31,122 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 00:48:31,122 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113433988] [2022-03-02 00:48:31,122 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113433988] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 00:48:31,122 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44810332] [2022-03-02 00:48:31,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:48:31,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 00:48:31,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 00:48:31,124 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-02 00:48:31,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-02 00:48:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:48:31,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 1529 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-02 00:48:31,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 00:48:32,583 INFO L134 CoverageAnalysis]: Checked inductivity of 5341 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 4683 trivial. 0 not checked. [2022-03-02 00:48:32,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-02 00:48:34,020 INFO L134 CoverageAnalysis]: Checked inductivity of 5341 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 4683 trivial. 0 not checked. [2022-03-02 00:48:34,021 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44810332] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-02 00:48:34,021 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-02 00:48:34,021 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2022-03-02 00:48:34,021 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331994326] [2022-03-02 00:48:34,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-02 00:48:34,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-02 00:48:34,025 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 00:48:34,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-02 00:48:34,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2022-03-02 00:48:34,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:48:34,026 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 00:48:34,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 18.0) internal successors, (612), 34 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-02 00:48:34,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:48:34,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:34,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:34,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:48:34,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:34,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-02 00:48:34,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-03-02 00:48:34,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:48:34,686 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 2246 transitions and produced 1712 states. [2022-03-02 00:48:34,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:48:34,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:34,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:34,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:48:34,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:34,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-02 00:48:34,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-02 00:48:34,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-02 00:48:34,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-02 00:48:34,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 00:48:34,914 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-02 00:48:34,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 00:48:34,914 INFO L85 PathProgramCache]: Analyzing trace with hash 193955767, now seen corresponding path program 2 times [2022-03-02 00:48:34,914 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 00:48:34,915 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144528626] [2022-03-02 00:48:34,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:48:34,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 00:48:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:48:35,813 INFO L134 CoverageAnalysis]: Checked inductivity of 7953 backedges. 0 proven. 3270 refuted. 0 times theorem prover too weak. 4683 trivial. 0 not checked. [2022-03-02 00:48:35,814 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 00:48:35,814 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144528626] [2022-03-02 00:48:35,814 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144528626] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 00:48:35,814 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427053826] [2022-03-02 00:48:35,814 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-02 00:48:35,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 00:48:35,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 00:48:35,820 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-02 00:48:35,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-02 00:48:36,278 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-02 00:48:36,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-02 00:48:36,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 2041 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-02 00:48:36,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 00:48:37,793 INFO L134 CoverageAnalysis]: Checked inductivity of 7953 backedges. 0 proven. 3270 refuted. 0 times theorem prover too weak. 4683 trivial. 0 not checked. [2022-03-02 00:48:37,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-02 00:48:39,551 INFO L134 CoverageAnalysis]: Checked inductivity of 7953 backedges. 0 proven. 3270 refuted. 0 times theorem prover too weak. 4683 trivial. 0 not checked. [2022-03-02 00:48:39,551 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427053826] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-02 00:48:39,551 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-02 00:48:39,552 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 43 [2022-03-02 00:48:39,552 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273886220] [2022-03-02 00:48:39,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-02 00:48:39,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-03-02 00:48:39,554 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 00:48:39,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-03-02 00:48:39,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2022-03-02 00:48:39,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:48:39,555 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 00:48:39,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 17.837209302325583) internal successors, (767), 43 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-02 00:48:39,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:48:39,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:39,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:39,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:48:39,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:39,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-02 00:48:39,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-03-02 00:48:39,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-03-02 00:48:39,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:48:40,533 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 2571 transitions and produced 1882 states. [2022-03-02 00:48:40,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:48:40,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:40,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:40,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:48:40,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:40,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-02 00:48:40,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-02 00:48:40,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-02 00:48:40,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-03-02 00:48:40,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-02 00:48:40,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 00:48:40,752 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-02 00:48:40,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 00:48:40,752 INFO L85 PathProgramCache]: Analyzing trace with hash -2083782119, now seen corresponding path program 3 times [2022-03-02 00:48:40,752 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 00:48:40,752 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992566272] [2022-03-02 00:48:40,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:48:40,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 00:48:40,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:48:42,086 INFO L134 CoverageAnalysis]: Checked inductivity of 10593 backedges. 4282 proven. 401 refuted. 0 times theorem prover too weak. 5910 trivial. 0 not checked. [2022-03-02 00:48:42,087 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 00:48:42,087 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992566272] [2022-03-02 00:48:42,087 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992566272] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 00:48:42,087 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671589265] [2022-03-02 00:48:42,088 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-02 00:48:42,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 00:48:42,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 00:48:42,090 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-02 00:48:42,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-02 00:48:42,487 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-02 00:48:42,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-02 00:48:42,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 63 conjunts are in the unsatisfiable core [2022-03-02 00:48:42,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 00:48:45,256 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-02 00:48:45,300 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-02 00:48:46,579 INFO L134 CoverageAnalysis]: Checked inductivity of 10593 backedges. 937 proven. 77 refuted. 0 times theorem prover too weak. 9579 trivial. 0 not checked. [2022-03-02 00:48:46,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-02 00:48:48,431 INFO L134 CoverageAnalysis]: Checked inductivity of 10593 backedges. 627 proven. 6 refuted. 0 times theorem prover too weak. 9960 trivial. 0 not checked. [2022-03-02 00:48:48,431 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671589265] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-02 00:48:48,431 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-02 00:48:48,432 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 18, 15] total 74 [2022-03-02 00:48:48,434 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797112983] [2022-03-02 00:48:48,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-02 00:48:48,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-03-02 00:48:48,437 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 00:48:48,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-03-02 00:48:48,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=627, Invalid=4775, Unknown=0, NotChecked=0, Total=5402 [2022-03-02 00:48:48,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:48:48,440 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 00:48:48,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 11.567567567567568) internal successors, (856), 74 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-02 00:48:48,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:48:48,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:48,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:48,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:48:48,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:48,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-02 00:48:48,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-03-02 00:48:48,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-03-02 00:48:48,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-03-02 00:48:48,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:48:56,743 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 6302 transitions and produced 3413 states. [2022-03-02 00:48:56,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:48:56,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:56,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:56,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:48:56,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:48:56,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-02 00:48:56,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-02 00:48:56,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-02 00:48:56,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-03-02 00:48:56,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2022-03-02 00:48:56,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-02 00:48:56,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 00:48:56,945 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-02 00:48:56,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 00:48:56,946 INFO L85 PathProgramCache]: Analyzing trace with hash -518529853, now seen corresponding path program 1 times [2022-03-02 00:48:56,946 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 00:48:56,946 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579137862] [2022-03-02 00:48:56,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:48:56,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 00:48:57,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:48:58,244 INFO L134 CoverageAnalysis]: Checked inductivity of 5910 backedges. 1938 proven. 37 refuted. 0 times theorem prover too weak. 3935 trivial. 0 not checked. [2022-03-02 00:48:58,244 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 00:48:58,244 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579137862] [2022-03-02 00:48:58,244 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579137862] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 00:48:58,245 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329456822] [2022-03-02 00:48:58,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:48:58,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 00:48:58,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 00:48:58,246 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-02 00:48:58,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-02 00:48:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:48:58,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 1605 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-02 00:48:58,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 00:49:00,157 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-02 00:49:00,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 00:49:00,210 INFO L387 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-03-02 00:49:00,353 INFO L353 Elim1Store]: treesize reduction 69, result has 15.9 percent of original size [2022-03-02 00:49:00,353 INFO L387 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 30 [2022-03-02 00:49:00,381 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-03-02 00:49:00,381 INFO L387 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-03-02 00:49:00,394 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-02 00:49:00,802 INFO L134 CoverageAnalysis]: Checked inductivity of 5910 backedges. 3275 proven. 204 refuted. 0 times theorem prover too weak. 2431 trivial. 0 not checked. [2022-03-02 00:49:00,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-02 00:49:09,487 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1676 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1676) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)) is different from false [2022-03-02 00:49:09,510 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-02 00:49:09,510 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-03-02 00:49:09,520 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-02 00:49:09,520 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 39 [2022-03-02 00:49:09,525 INFO L387 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-03-02 00:49:10,432 INFO L134 CoverageAnalysis]: Checked inductivity of 5910 backedges. 3227 proven. 204 refuted. 0 times theorem prover too weak. 2431 trivial. 48 not checked. [2022-03-02 00:49:10,433 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329456822] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-02 00:49:10,433 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-02 00:49:10,433 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 12] total 37 [2022-03-02 00:49:10,433 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112896245] [2022-03-02 00:49:10,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-02 00:49:10,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-02 00:49:10,435 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 00:49:10,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-02 00:49:10,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1104, Unknown=1, NotChecked=68, Total=1332 [2022-03-02 00:49:10,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:49:10,437 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 00:49:10,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 14.45945945945946) internal successors, (535), 37 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-02 00:49:10,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:49:10,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:49:10,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:49:10,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:49:10,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:49:10,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-02 00:49:10,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-03-02 00:49:10,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-03-02 00:49:10,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-03-02 00:49:10,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 137 states. [2022-03-02 00:49:10,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:49:11,387 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 6382 transitions and produced 3453 states. [2022-03-02 00:49:11,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:49:11,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:49:11,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:49:11,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:49:11,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:49:11,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-02 00:49:11,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-02 00:49:11,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-02 00:49:11,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-03-02 00:49:11,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2022-03-02 00:49:11,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-02 00:49:11,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-03-02 00:49:11,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-03-02 00:49:11,616 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-02 00:49:11,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 00:49:11,616 INFO L85 PathProgramCache]: Analyzing trace with hash 795465041, now seen corresponding path program 1 times [2022-03-02 00:49:11,616 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 00:49:11,616 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51866504] [2022-03-02 00:49:11,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:49:11,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 00:49:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:49:12,772 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 2359 proven. 71 refuted. 0 times theorem prover too weak. 3460 trivial. 0 not checked. [2022-03-02 00:49:12,772 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 00:49:12,772 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51866504] [2022-03-02 00:49:12,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51866504] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 00:49:12,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733190526] [2022-03-02 00:49:12,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:49:12,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 00:49:12,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 00:49:12,774 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-02 00:49:12,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-02 00:49:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:49:13,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 1655 conjuncts, 56 conjunts are in the unsatisfiable core [2022-03-02 00:49:13,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 00:49:13,908 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-02 00:49:13,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 00:49:13,964 INFO L387 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-03-02 00:49:14,147 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-02 00:49:14,154 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-02 00:49:14,154 INFO L387 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-03-02 00:49:14,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 00:49:14,202 INFO L387 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-03-02 00:49:14,338 INFO L387 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-03-02 00:49:14,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 00:49:14,405 INFO L387 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-03-02 00:49:14,545 INFO L353 Elim1Store]: treesize reduction 53, result has 19.7 percent of original size [2022-03-02 00:49:14,546 INFO L387 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-03-02 00:49:14,577 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-03-02 00:49:14,577 INFO L387 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-03-02 00:49:14,595 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-02 00:49:15,293 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 2335 proven. 95 refuted. 0 times theorem prover too weak. 3460 trivial. 0 not checked. [2022-03-02 00:49:15,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-02 00:49:16,265 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2068 Int) (v_ArrVal_2066 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2066) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2068)) .cse1)) 20))) is different from false [2022-03-02 00:49:16,302 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2068 Int) (v_ArrVal_2066 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2066) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2068)) .cse1)) 20))) is different from false [2022-03-02 00:49:16,310 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2068 Int) (v_ArrVal_2066 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2066) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2068)) .cse1)) 20))) is different from false [2022-03-02 00:49:16,317 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2068 Int) (v_ArrVal_2066 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2066) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2068)) .cse1)) 20))) is different from false [2022-03-02 00:49:16,346 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2062 Int) (v_ArrVal_2068 Int) (v_ArrVal_2066 (Array Int Int))) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2062)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2066) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2068)) .cse1))))) is different from false [2022-03-02 00:49:16,368 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2062 Int) (v_ArrVal_2068 Int) (v_ArrVal_2066 (Array Int Int)) (v_ArrVal_2060 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (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_2060) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2062)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2066) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2068)) .cse1)) 20))) is different from false [2022-03-02 00:49:16,389 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| Int)) (or (forall ((v_ArrVal_2062 Int) (v_ArrVal_2068 Int) (v_ArrVal_2066 (Array Int Int)) (v_ArrVal_2060 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2060) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2062)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2066) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2068)) .cse1)) 20))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) is different from false [2022-03-02 00:49:16,426 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| Int) (v_ArrVal_2062 Int) (v_ArrVal_2068 Int) (v_ArrVal_2066 (Array Int Int)) (v_ArrVal_2060 Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| (select .cse0 .cse1))) (not (= (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2060) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2062))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2066) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2068)) .cse3)) 20))))) is different from false [2022-03-02 00:49:16,478 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| Int) (v_ArrVal_2062 Int) (v_ArrVal_2068 Int) (v_ArrVal_2066 (Array Int Int)) (v_ArrVal_2060 Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse2 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| 4) |c_~#queue~0.offset|) v_ArrVal_2060) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2062))) (store .cse2 .cse1 (+ (select .cse2 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2066) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2068)) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| (select .cse3 .cse1)))))) is different from false [2022-03-02 00:49:16,669 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| Int) (v_ArrVal_2062 Int) (v_ArrVal_2059 (Array Int Int)) (v_ArrVal_2068 Int) (v_ArrVal_2066 (Array Int Int)) (v_ArrVal_2060 Int)) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2059))) (let ((.cse4 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| 4) |c_~#queue~0.offset|) v_ArrVal_2060) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2062))) (store .cse3 .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2066) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2068)) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| (select .cse4 .cse1))))))) is different from false [2022-03-02 00:49:16,753 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-02 00:49:16,754 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 215 treesize of output 155 [2022-03-02 00:49:16,763 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-02 00:49:16,764 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 247 treesize of output 245 [2022-03-02 00:49:16,769 INFO L387 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 834 treesize of output 806 [2022-03-02 00:49:16,790 INFO L387 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 829 treesize of output 805 [2022-03-02 00:49:16,890 INFO L387 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-03-02 00:49:16,906 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-02 00:49:16,906 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 701 treesize of output 681 [2022-03-02 00:49:17,406 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 2239 proven. 66 refuted. 0 times theorem prover too weak. 3460 trivial. 125 not checked. [2022-03-02 00:49:17,407 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733190526] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-02 00:49:17,407 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-02 00:49:17,407 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 22] total 55 [2022-03-02 00:49:17,407 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371201154] [2022-03-02 00:49:17,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-02 00:49:17,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-03-02 00:49:17,409 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 00:49:17,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-03-02 00:49:17,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=1737, Unknown=10, NotChecked=950, Total=2970 [2022-03-02 00:49:17,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:49:17,411 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 00:49:17,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 11.872727272727273) internal successors, (653), 55 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-02 00:49:17,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:49:17,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:49:17,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:49:17,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:49:17,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:49:17,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-02 00:49:17,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-03-02 00:49:17,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-03-02 00:49:17,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-03-02 00:49:17,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 137 states. [2022-03-02 00:49:17,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-03-02 00:49:17,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:49:18,195 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_init_#in~q#1.offset| 0) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| Int) (v_ArrVal_2062 Int) (v_ArrVal_2059 (Array Int Int)) (v_ArrVal_2068 Int) (v_ArrVal_2066 (Array Int Int)) (v_ArrVal_2060 Int)) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2059))) (let ((.cse4 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| 4) |c_~#queue~0.offset|) v_ArrVal_2060) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2062))) (store .cse3 .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2066) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2068)) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| (select .cse4 .cse1))))))) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_ULTIMATE.start_init_~q#1.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (= 7 |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-03-02 00:49:18,523 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| Int) (v_ArrVal_2062 Int) (v_ArrVal_2059 (Array Int Int)) (v_ArrVal_2068 Int) (v_ArrVal_2066 (Array Int Int)) (v_ArrVal_2060 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2059))) (let ((.cse5 (select .cse3 |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| 4) |c_~#queue~0.offset|) v_ArrVal_2060) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2062))) (store .cse4 .cse2 (+ (select .cse4 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2066) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2068)) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| (select .cse5 .cse2))))))) (= |c_~#queue~0.offset| 0) (= (select .cse0 84) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-03-02 00:49:18,925 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 (+ 84 |c_~#queue~0.offset|)) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| Int) (v_ArrVal_2062 Int) (v_ArrVal_2068 Int) (v_ArrVal_2066 (Array Int Int)) (v_ArrVal_2060 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (store (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| 4) |c_~#queue~0.offset|) v_ArrVal_2060) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2062))) (store .cse3 .cse2 (+ (select .cse3 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2066) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2068)) .cse2) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| (select .cse4 .cse2)))))) (= |c_~#queue~0.offset| 0) (= (select .cse0 84) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-03-02 00:49:19,290 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| Int) (v_ArrVal_2062 Int) (v_ArrVal_2068 Int) (v_ArrVal_2066 (Array Int Int)) (v_ArrVal_2060 Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| (select .cse0 .cse1))) (not (= (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2060) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2062))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2066) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2068)) .cse3)) 20))))) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-03-02 00:49:21,294 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| Int)) (or (forall ((v_ArrVal_2062 Int) (v_ArrVal_2068 Int) (v_ArrVal_2066 (Array Int Int)) (v_ArrVal_2060 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2060) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2062)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2066) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2068)) .cse1)) 20))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-03-02 00:49:22,633 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| Int) (v_ArrVal_2062 Int) (v_ArrVal_2059 (Array Int Int)) (v_ArrVal_2068 Int) (v_ArrVal_2066 (Array Int Int)) (v_ArrVal_2060 Int)) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2059))) (let ((.cse4 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| 4) |c_~#queue~0.offset|) v_ArrVal_2060) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2062))) (store .cse3 .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2066) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2068)) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_199| (select .cse4 .cse1))))))) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |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|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (= 7 |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 1) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-03-02 00:49:22,877 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 6406 transitions and produced 3465 states. [2022-03-02 00:49:22,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:49:22,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:49:22,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:49:22,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:49:22,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:49:22,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-02 00:49:22,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-02 00:49:22,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-02 00:49:22,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-03-02 00:49:22,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2022-03-02 00:49:22,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-02 00:49:22,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-02 00:49:22,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-02 00:49:23,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 00:49:23,079 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-02 00:49:23,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 00:49:23,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1693503490, now seen corresponding path program 2 times [2022-03-02 00:49:23,080 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 00:49:23,080 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763194025] [2022-03-02 00:49:23,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:49:23,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 00:49:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:49:24,504 INFO L134 CoverageAnalysis]: Checked inductivity of 6040 backedges. 3365 proven. 275 refuted. 0 times theorem prover too weak. 2400 trivial. 0 not checked. [2022-03-02 00:49:24,504 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 00:49:24,504 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763194025] [2022-03-02 00:49:24,504 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763194025] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 00:49:24,504 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464787561] [2022-03-02 00:49:24,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-02 00:49:24,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 00:49:24,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 00:49:24,506 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-02 00:49:24,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-02 00:49:24,975 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-02 00:49:24,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-02 00:49:24,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 1670 conjuncts, 72 conjunts are in the unsatisfiable core [2022-03-02 00:49:25,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 00:49:25,114 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-03-02 00:49:25,114 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-03-02 00:49:25,152 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-03-02 00:49:25,152 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-03-02 00:49:25,290 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-02 00:49:25,338 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-03-02 00:49:25,338 INFO L387 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-03-02 00:49:25,670 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-03-02 00:49:25,736 INFO L387 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-03-02 00:49:25,926 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-02 00:49:25,935 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-02 00:49:25,935 INFO L387 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-03-02 00:49:25,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 00:49:25,982 INFO L387 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-03-02 00:49:26,005 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-02 00:49:26,798 INFO L134 CoverageAnalysis]: Checked inductivity of 6040 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 5659 trivial. 0 not checked. [2022-03-02 00:49:26,798 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-02 00:49:26,798 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464787561] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-02 00:49:26,798 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-02 00:49:26,799 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [24] total 39 [2022-03-02 00:49:26,799 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590808986] [2022-03-02 00:49:26,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-02 00:49:26,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-02 00:49:26,799 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 00:49:26,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-02 00:49:26,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1315, Unknown=0, NotChecked=0, Total=1482 [2022-03-02 00:49:26,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:49:26,800 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 00:49:26,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 11.352941176470589) internal successors, (193), 17 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-02 00:49:26,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:49:26,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:49:26,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:49:26,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:49:26,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:49:26,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-02 00:49:26,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-03-02 00:49:26,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-03-02 00:49:26,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-03-02 00:49:26,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 137 states. [2022-03-02 00:49:26,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-03-02 00:49:26,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-03-02 00:49:26,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:49:27,591 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 6406 transitions and produced 3465 states. [2022-03-02 00:49:27,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:49:27,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:49:27,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:49:27,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:49:27,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:49:27,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-02 00:49:27,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-02 00:49:27,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-02 00:49:27,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-03-02 00:49:27,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2022-03-02 00:49:27,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-02 00:49:27,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-02 00:49:27,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:49:27,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-02 00:49:27,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-02 00:49:27,794 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-02 00:49:27,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 00:49:27,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1756260456, now seen corresponding path program 3 times [2022-03-02 00:49:27,795 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 00:49:27,795 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759308879] [2022-03-02 00:49:27,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:49:27,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 00:49:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:49:29,215 INFO L134 CoverageAnalysis]: Checked inductivity of 6040 backedges. 1783 proven. 331 refuted. 0 times theorem prover too weak. 3926 trivial. 0 not checked. [2022-03-02 00:49:29,215 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 00:49:29,215 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759308879] [2022-03-02 00:49:29,215 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759308879] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 00:49:29,216 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137346697] [2022-03-02 00:49:29,216 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-02 00:49:29,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 00:49:29,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 00:49:29,217 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-02 00:49:29,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-02 00:49:29,794 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-02 00:49:29,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-02 00:49:29,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 93 conjunts are in the unsatisfiable core [2022-03-02 00:49:29,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 00:49:33,934 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-02 00:49:34,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 00:49:34,022 INFO L387 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-03-02 00:49:34,325 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-02 00:49:34,334 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-02 00:49:34,335 INFO L387 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-03-02 00:49:34,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 00:49:34,433 INFO L387 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-03-02 00:49:34,700 INFO L387 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 34 treesize of output 18 [2022-03-02 00:49:34,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 00:49:34,827 INFO L387 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-03-02 00:49:35,136 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-02 00:49:35,145 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-02 00:49:35,145 INFO L387 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-03-02 00:49:35,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 00:49:35,241 INFO L387 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-03-02 00:49:35,556 INFO L387 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 34 treesize of output 18 [2022-03-02 00:49:35,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 00:49:35,691 INFO L387 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-03-02 00:49:36,012 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-02 00:49:36,019 INFO L353 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-03-02 00:49:36,020 INFO L387 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-03-02 00:49:36,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 00:49:36,101 INFO L387 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-03-02 00:49:36,140 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-02 00:49:36,227 INFO L134 CoverageAnalysis]: Checked inductivity of 6040 backedges. 1633 proven. 481 refuted. 0 times theorem prover too weak. 3926 trivial. 0 not checked. [2022-03-02 00:49:36,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-02 00:49:36,686 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2852 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)) is different from false [2022-03-02 00:49:36,711 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int))) (or (not (<= v_ArrVal_2850 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20))) is different from false [2022-03-02 00:49:36,721 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_2850) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20))) is different from false [2022-03-02 00:49:36,732 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20) (< (+ (select .cse0 .cse1) 1) v_ArrVal_2850)))) is different from false [2022-03-02 00:49:36,796 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2848 Int) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2848)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20) (< (+ (select .cse0 .cse1) 1) v_ArrVal_2850)))) is different from false [2022-03-02 00:49:36,842 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2848 Int) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2847 Int)) (let ((.cse0 (store (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_2847) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2848)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2850) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)))) is different from false [2022-03-02 00:49:36,876 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_2848 Int) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2847 Int)) (let ((.cse0 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2847) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2848)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2850) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)))))) is different from false [2022-03-02 00:49:36,935 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2848 Int) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2847 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2847) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2848)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (or (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store .cse0 .cse1 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse2 .cse1))) (< (+ (select .cse0 .cse1) 1) v_ArrVal_2850))))) is different from false [2022-03-02 00:49:37,011 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2848 Int) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2847 Int)) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2848)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2850) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse2 .cse1))) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse1) 20))))) is different from false [2022-03-02 00:49:37,212 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2848 Int) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2847 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2845))) (let ((.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2848)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2850) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse2 .cse1))) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse1) 20)))))) is different from false [2022-03-02 00:49:37,450 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2848 Int) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2843 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2847 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2843)) |c_~#stored_elements~0.base| v_ArrVal_2845))) (let ((.cse3 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2848)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (not (<= v_ArrVal_2843 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse2) 20) (< (+ (select .cse1 .cse2) 1) v_ArrVal_2850) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse3 .cse2)))))))) is different from false [2022-03-02 00:49:37,515 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2848 Int) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2843 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2847 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2843)) |c_~#stored_elements~0.base| v_ArrVal_2845))) (let ((.cse3 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2848)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_2843) (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse2) 20) (< (+ (select .cse1 .cse2) 1) v_ArrVal_2850) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse3 .cse2)))))))) is different from false [2022-03-02 00:49:37,581 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2848 Int) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2843 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2847 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_2843)) |c_~#stored_elements~0.base| v_ArrVal_2845))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2848)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2843) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse4 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse4) 20) (< (+ (select .cse3 .cse4) 1) v_ArrVal_2850) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse5 .cse4))))))))) is different from false [2022-03-02 00:49:37,971 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2848 Int) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2841 Int) (v_ArrVal_2843 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2847 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2841)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_2843)) |c_~#stored_elements~0.base| v_ArrVal_2845))) (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (store (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2848)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2850) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2843) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse1) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse5 .cse1))))))))) is different from false [2022-03-02 00:49:38,288 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2848 Int) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2839 Int) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2841 Int) (v_ArrVal_2843 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2847 Int)) (let ((.cse2 (store (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_2839) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2841)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_2843)) |c_~#stored_elements~0.base| v_ArrVal_2845))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2848)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2850) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2843) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse4 .cse1))) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse1) 20))))))) is different from false [2022-03-02 00:49:38,508 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_2848 Int) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2839 Int) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2841 Int) (v_ArrVal_2843 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2847 Int)) (let ((.cse0 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2839) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2841)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_2843)) |c_~#stored_elements~0.base| v_ArrVal_2845))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2848)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2843) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse4 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse4) 20) (< (+ (select .cse3 .cse4) 1) v_ArrVal_2850) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse5 .cse4))))))))))) is different from false [2022-03-02 00:49:38,926 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2848 Int) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2839 Int) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2841 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| Int) (v_ArrVal_2843 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2847 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse6 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2839) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2841)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store .cse6 .cse1 v_ArrVal_2843)) |c_~#stored_elements~0.base| v_ArrVal_2845))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2848)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse2 .cse3))) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse5 .cse3 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse3) 20) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2843) (< (+ (select .cse5 .cse3) 1) v_ArrVal_2850)))))))) is different from false [2022-03-02 00:49:39,321 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2848 Int) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2839 Int) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2841 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| Int) (v_ArrVal_2843 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2847 Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse5 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| 4) |c_~#queue~0.offset|) v_ArrVal_2839) .cse6 v_ArrVal_2841)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse5 .cse2 v_ArrVal_2843)) |c_~#stored_elements~0.base| v_ArrVal_2845))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) .cse6 v_ArrVal_2848))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse2) 20) (< (+ (select .cse1 .cse2) 1) v_ArrVal_2850) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| (select .cse3 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse4 .cse2))) (< (+ (select .cse5 .cse2) 1) v_ArrVal_2843)))))))) is different from false [2022-03-02 00:49:40,559 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2848 Int) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2839 Int) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2841 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| Int) (v_ArrVal_2843 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2838 (Array Int Int)) (v_ArrVal_2847 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2838))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse2 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| 4) |c_~#queue~0.offset|) v_ArrVal_2839) .cse6 v_ArrVal_2841)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (store .cse2 .cse1 v_ArrVal_2843)) |c_~#stored_elements~0.base| v_ArrVal_2845))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) .cse6 v_ArrVal_2848))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2843) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| (select .cse3 .cse1))) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse5 .cse1 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2850))))))))) is different from false [2022-03-02 00:49:41,398 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-02 00:49:41,398 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 331 treesize of output 241 [2022-03-02 00:49:41,412 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-02 00:49:41,412 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 404 treesize of output 404 [2022-03-02 00:49:41,418 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-02 00:49:41,423 INFO L387 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 232 treesize of output 216 [2022-03-02 00:49:41,433 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-02 00:49:41,440 INFO L387 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 145 treesize of output 137 [2022-03-02 00:49:41,453 INFO L387 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 110 treesize of output 94 [2022-03-02 00:49:42,076 INFO L387 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-03-02 00:49:42,405 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-02 00:49:42,406 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 414 treesize of output 410 [2022-03-02 00:49:43,732 INFO L134 CoverageAnalysis]: Checked inductivity of 6040 backedges. 234 proven. 565 refuted. 0 times theorem prover too weak. 3926 trivial. 1315 not checked. [2022-03-02 00:49:43,733 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137346697] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-02 00:49:43,733 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-02 00:49:43,733 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 36] total 80 [2022-03-02 00:49:43,733 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066166859] [2022-03-02 00:49:43,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-02 00:49:43,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-03-02 00:49:43,735 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 00:49:43,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-03-02 00:49:43,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=646, Invalid=3071, Unknown=19, NotChecked=2584, Total=6320 [2022-03-02 00:49:43,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:49:43,736 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 00:49:43,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 9.2875) internal successors, (743), 80 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-02 00:49:43,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:49:43,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:49:43,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:49:43,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:49:43,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:49:43,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-02 00:49:43,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-03-02 00:49:43,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-03-02 00:49:43,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-03-02 00:49:43,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 137 states. [2022-03-02 00:49:43,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-03-02 00:49:43,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-03-02 00:49:43,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:49:43,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:49:44,735 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)))) (and (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (forall ((v_ArrVal_2848 Int) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2839 Int) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2841 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| Int) (v_ArrVal_2843 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2838 (Array Int Int)) (v_ArrVal_2847 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2838))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse2 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| 4) |c_~#queue~0.offset|) v_ArrVal_2839) .cse6 v_ArrVal_2841)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (store .cse2 .cse1 v_ArrVal_2843)) |c_~#stored_elements~0.base| v_ArrVal_2845))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) .cse6 v_ArrVal_2848))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2843) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| (select .cse3 .cse1))) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse5 .cse1 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2850))))))))) (= |c_~#queue~0.offset| 0) (= |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|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (= 7 |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 1) (< |c_t1Thread1of1ForFork0_~i~0#1| 20) (<= .cse8 1) (<= .cse8 3) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-03-02 00:49:45,221 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_2848 Int) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2839 Int) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2841 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| Int) (v_ArrVal_2843 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2838 (Array Int Int)) (v_ArrVal_2847 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2838))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse2 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| 4) |c_~#queue~0.offset|) v_ArrVal_2839) .cse6 v_ArrVal_2841)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (store .cse2 .cse1 v_ArrVal_2843)) |c_~#stored_elements~0.base| v_ArrVal_2845))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) .cse6 v_ArrVal_2848))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2843) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| (select .cse3 .cse1))) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse5 .cse1 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2850))))))))) (= |c_~#queue~0.offset| 0) (= (select .cse8 84) 1) (= 7 |c_~#queue~0.base|) (<= (select .cse8 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-03-02 00:49:45,801 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_2848 Int) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2839 Int) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2841 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| Int) (v_ArrVal_2843 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2847 Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse5 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| 4) |c_~#queue~0.offset|) v_ArrVal_2839) .cse6 v_ArrVal_2841)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse5 .cse2 v_ArrVal_2843)) |c_~#stored_elements~0.base| v_ArrVal_2845))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) .cse6 v_ArrVal_2848))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse2) 20) (< (+ (select .cse1 .cse2) 1) v_ArrVal_2850) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| (select .cse3 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse4 .cse2))) (< (+ (select .cse5 .cse2) 1) v_ArrVal_2843)))))))) (= (select .cse7 84) 1) (= 7 |c_~#queue~0.base|) (<= (select .cse7 (+ 84 |c_~#queue~0.offset|)) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-03-02 00:49:46,352 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse8 (select .cse7 (+ 84 |c_~#queue~0.offset|)))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_2848 Int) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2839 Int) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2841 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| Int) (v_ArrVal_2843 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2847 Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse5 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| 4) |c_~#queue~0.offset|) v_ArrVal_2839) .cse6 v_ArrVal_2841)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse5 .cse2 v_ArrVal_2843)) |c_~#stored_elements~0.base| v_ArrVal_2845))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) .cse6 v_ArrVal_2848))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse2) 20) (< (+ (select .cse1 .cse2) 1) v_ArrVal_2850) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| (select .cse3 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse4 .cse2))) (< (+ (select .cse5 .cse2) 1) v_ArrVal_2843)))))))) (= (select .cse7 84) 1) (= 7 |c_~#queue~0.base|) (< |c_t1Thread1of1ForFork0_~i~0#1| 20) (<= .cse8 1) (<= .cse8 3) (<= |c_~#stored_elements~0.base| 6)))) is different from false [2022-03-02 00:49:46,906 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)))) (and (forall ((v_ArrVal_2848 Int) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2839 Int) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2841 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| Int) (v_ArrVal_2843 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2847 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse6 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2839) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2841)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store .cse6 .cse1 v_ArrVal_2843)) |c_~#stored_elements~0.base| v_ArrVal_2845))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2848)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse2 .cse3))) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse5 .cse3 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse3) 20) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2843) (< (+ (select .cse5 .cse3) 1) v_ArrVal_2850)))))))) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 1) (< |c_t1Thread1of1ForFork0_~i~0#1| 20) (<= .cse7 1) (<= .cse7 3) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-03-02 00:49:48,911 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)))) (and (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (= 7 |c_~#queue~0.base|) (< |c_t1Thread1of1ForFork0_~i~0#1| 20) (<= .cse0 1) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_2848 Int) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2839 Int) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2841 Int) (v_ArrVal_2843 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2847 Int)) (let ((.cse1 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2839) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2841)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_2843)) |c_~#stored_elements~0.base| v_ArrVal_2845))) (let ((.cse6 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2848)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (select .cse1 .cse2) 1) v_ArrVal_2843) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse5 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse5) 20) (< (+ (select .cse4 .cse5) 1) v_ArrVal_2850) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse6 .cse5))))))))))) (<= .cse0 3) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-03-02 00:49:49,752 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)))) (and (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (<= .cse0 2) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post41#1| 1) (forall ((v_ArrVal_2848 Int) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2847 Int)) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2845))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2848)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (select .cse1 .cse2) 1) v_ArrVal_2850) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse3 .cse2))) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse2) 20)))))) (= 7 |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) (< |c_t1Thread1of1ForFork0_~i~0#1| 20) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post41#1| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (<= .cse0 3) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-03-02 00:49:50,170 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| 0) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 2) (forall ((v_ArrVal_2848 Int) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2847 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2845))) (let ((.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2848)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2850) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse2 .cse1))) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse1) 20)))))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2022-03-02 00:49:50,555 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#queue~0.offset| 0) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 2) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6) (forall ((v_ArrVal_2848 Int) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2847 Int)) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2848)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2850) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse2 .cse1))) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse1) 20)))))) is different from false [2022-03-02 00:49:50,993 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)))) (and (= |c_~#queue~0.offset| 0) (<= .cse0 2) (= 7 |c_~#queue~0.base|) (< |c_t1Thread1of1ForFork0_~i~0#1| 20) (<= .cse0 3) (<= |c_~#stored_elements~0.base| 6) (forall ((v_ArrVal_2848 Int) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2847 Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse1 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2847) (+ 88 |c_~#queue~0.offset|) v_ArrVal_2848)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (select .cse1 .cse2) 1) v_ArrVal_2850) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse3 .cse2))) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse1 .cse2 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) .cse2) 20))))))) is different from false [2022-03-02 00:49:51,392 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)))) (and (forall ((v_ArrVal_2848 Int) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2847 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2847) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2848)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (or (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store .cse0 .cse1 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse2 .cse1))) (< (+ (select .cse0 .cse1) 1) v_ArrVal_2850))))) (= |c_~#queue~0.offset| 0) (<= .cse3 2) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (< |c_t1Thread1of1ForFork0_~i~0#1| 20) (<= .cse3 3) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-03-02 00:49:53,396 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)))) (and (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (<= .cse0 2) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_2848 Int) (v_ArrVal_2850 Int) (v_ArrVal_2852 (Array Int Int)) (v_ArrVal_2847 Int)) (let ((.cse1 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2847) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2848)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (+ (select .cse1 .cse2) 1) v_ArrVal_2850) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_2850)) |c_~#stored_elements~0.base| v_ArrVal_2852) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)))))) (= 7 |c_~#queue~0.base|) (< |c_t1Thread1of1ForFork0_~i~0#1| 20) (<= .cse0 3) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-03-02 00:49:54,698 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 6422 transitions and produced 3473 states. [2022-03-02 00:49:54,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:49:54,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:49:54,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:49:54,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:49:54,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:49:54,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-02 00:49:54,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-02 00:49:54,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-02 00:49:54,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-03-02 00:49:54,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2022-03-02 00:49:54,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-02 00:49:54,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-02 00:49:54,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:49:54,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-02 00:49:54,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-02 00:49:54,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-02 00:49:54,900 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-03-02 00:49:54,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 00:49:54,900 INFO L85 PathProgramCache]: Analyzing trace with hash -937047652, now seen corresponding path program 4 times [2022-03-02 00:49:54,901 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 00:49:54,901 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453077023] [2022-03-02 00:49:54,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:49:54,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 00:49:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:49:57,043 INFO L134 CoverageAnalysis]: Checked inductivity of 6180 backedges. 3433 proven. 248 refuted. 0 times theorem prover too weak. 2499 trivial. 0 not checked. [2022-03-02 00:49:57,044 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 00:49:57,044 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453077023] [2022-03-02 00:49:57,044 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453077023] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 00:49:57,044 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700457203] [2022-03-02 00:49:57,044 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-02 00:49:57,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 00:49:57,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 00:49:57,046 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-02 00:49:57,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-02 00:50:08,849 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-02 00:50:08,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-02 00:50:08,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 1680 conjuncts, 107 conjunts are in the unsatisfiable core [2022-03-02 00:50:08,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 00:50:09,448 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-03-02 00:50:09,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 00:50:09,503 INFO L387 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-03-02 00:50:09,707 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-02 00:50:09,714 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-02 00:50:09,715 INFO L387 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-03-02 00:50:09,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 00:50:09,762 INFO L387 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-03-02 00:50:09,905 INFO L387 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-03-02 00:50:09,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 00:50:09,981 INFO L387 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-03-02 00:50:10,182 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-02 00:50:10,189 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-02 00:50:10,190 INFO L387 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-03-02 00:50:10,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 00:50:10,244 INFO L387 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-03-02 00:50:10,443 INFO L387 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-03-02 00:50:10,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 00:50:10,509 INFO L387 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 18 treesize of output 20 [2022-03-02 00:50:10,708 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-02 00:50:10,716 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-02 00:50:10,717 INFO L387 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 36 treesize of output 29 [2022-03-02 00:50:10,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 00:50:10,762 INFO L387 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 25 treesize of output 24 [2022-03-02 00:50:10,967 INFO L387 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 33 treesize of output 17 [2022-03-02 00:50:11,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 00:50:11,057 INFO L387 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 18 treesize of output 20 [2022-03-02 00:50:11,247 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-02 00:50:11,253 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-03-02 00:50:11,254 INFO L387 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 36 treesize of output 29 [2022-03-02 00:50:11,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 00:50:11,305 INFO L387 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 25 treesize of output 24 [2022-03-02 00:50:11,322 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-03-02 00:50:11,892 INFO L134 CoverageAnalysis]: Checked inductivity of 6180 backedges. 2818 proven. 235 refuted. 0 times theorem prover too weak. 3127 trivial. 0 not checked. [2022-03-02 00:50:11,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-02 00:50:27,100 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3257 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse0 .cse1)))))) is different from false [2022-03-02 00:50:27,166 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3257 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int)) (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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1) 20))))) is different from false [2022-03-02 00:50:27,179 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3257 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int)) (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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse0 .cse1)))))) is different from false [2022-03-02 00:50:27,191 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3257 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int)) (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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse0 .cse1)))))) is different from false [2022-03-02 00:50:27,253 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3257 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_3253 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3253)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ 1 (select .cse2 .cse3))))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse0 .cse1)))))) is different from false [2022-03-02 00:50:27,300 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3257 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_3253 Int) (v_ArrVal_3251 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (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_3251) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3253)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse0 .cse1)))))) is different from false [2022-03-02 00:50:27,333 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int)) (or (forall ((v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3257 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_3253 Int) (v_ArrVal_3251 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3251) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3253)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse0 .cse1)))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) is different from false [2022-03-02 00:50:27,410 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3257 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_3253 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_3251 Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_3251) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_3253))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse2 .cse3))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse3) 20)))))) is different from false [2022-03-02 00:50:27,487 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3257 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_3253 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_3251 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_3251) (+ 88 |c_~#queue~0.offset|) v_ArrVal_3253))) (store .cse3 .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse0 .cse1))))))) is different from false [2022-03-02 00:50:27,696 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3257 Int) (v_ArrVal_3249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_3253 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_3251 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3249))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_3251) (+ 88 |c_~#queue~0.offset|) v_ArrVal_3253))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse0 .cse1))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse2 .cse1)))))))) is different from false [2022-03-02 00:50:27,876 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3257 Int) (v_ArrVal_3249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_3253 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_3251 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_3249))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_3251) (+ 88 |c_~#queue~0.offset|) v_ArrVal_3253))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse0 .cse1))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse2 .cse1)))))))) is different from false [2022-03-02 00:50:27,904 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3257 Int) (v_ArrVal_3249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_3253 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_3251 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_3249))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_3251) (+ 88 |c_~#queue~0.offset|) v_ArrVal_3253))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1) 20))))))) is different from false [2022-03-02 00:50:27,930 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3257 Int) (v_ArrVal_3249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_3253 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_3251 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3249))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_3251) (+ 88 |c_~#queue~0.offset|) v_ArrVal_3253))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse2 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1) 20))))))) is different from false [2022-03-02 00:50:28,085 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3245 Int) (v_ArrVal_3257 Int) (v_ArrVal_3249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_3253 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_3251 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3245)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3249))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_3251) (+ 88 |c_~#queue~0.offset|) v_ArrVal_3253))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse2 .cse1)))))))) is different from false [2022-03-02 00:50:28,204 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3245 Int) (v_ArrVal_3257 Int) (v_ArrVal_3243 Int) (v_ArrVal_3249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_3253 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_3251 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store (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_3243) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3245)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3249))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_3251) (+ 88 |c_~#queue~0.offset|) v_ArrVal_3253))) (store .cse4 .cse1 (+ 1 (select .cse4 .cse1))))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse2 .cse1))) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1)))))))) is different from false [2022-03-02 00:50:28,293 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int)) (or (forall ((v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3245 Int) (v_ArrVal_3257 Int) (v_ArrVal_3243 Int) (v_ArrVal_3249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_3253 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_3251 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3243) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3245)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3249))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_3251) (+ 88 |c_~#queue~0.offset|) v_ArrVal_3253))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse2 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1) 20))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))))) is different from false [2022-03-02 00:50:28,497 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3245 Int) (v_ArrVal_3257 Int) (v_ArrVal_3243 Int) (v_ArrVal_3249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_3253 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_3251 Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse7 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_3243) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_3245))) (store .cse7 .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3249))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_3251) (+ 88 |c_~#queue~0.offset|) v_ArrVal_3253))) (store .cse6 .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse2 .cse3))) (not (= (select (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse3) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse4 .cse3))))))))) is different from false [2022-03-02 00:50:28,712 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3245 Int) (v_ArrVal_3257 Int) (v_ArrVal_3243 Int) (v_ArrVal_3249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_3253 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_3251 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse7 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_~#queue~0.offset|) v_ArrVal_3243) .cse6 v_ArrVal_3245))) (store .cse7 .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3249))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_3251) .cse6 v_ArrVal_3253))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| (select .cse2 .cse1))) (not (= 20 (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse3 .cse1))))))))) is different from false [2022-03-02 00:50:29,348 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3242 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3245 Int) (v_ArrVal_3257 Int) (v_ArrVal_3243 Int) (v_ArrVal_3249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_3253 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_3251 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3242))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_~#queue~0.offset|) v_ArrVal_3243) .cse6 v_ArrVal_3245))) (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3249))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_3251) .cse6 v_ArrVal_3253))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| (select .cse3 .cse1)))))))))) is different from false [2022-03-02 00:50:29,864 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3242 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3245 Int) (v_ArrVal_3257 Int) (v_ArrVal_3243 Int) (v_ArrVal_3249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_3253 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_3251 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_3242))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_~#queue~0.offset|) v_ArrVal_3243) .cse6 v_ArrVal_3245))) (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3249))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_3251) .cse6 v_ArrVal_3253))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse0 .cse1)))))))))) is different from false [2022-03-02 00:50:29,927 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3242 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3245 Int) (v_ArrVal_3257 Int) (v_ArrVal_3243 Int) (v_ArrVal_3249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_3253 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_3251 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_3242))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_~#queue~0.offset|) v_ArrVal_3243) .cse6 v_ArrVal_3245))) (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3249))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_3251) .cse6 v_ArrVal_3253))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| (select .cse2 .cse1))) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse3 .cse1)))))))))) is different from false [2022-03-02 00:50:29,991 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3242 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3245 Int) (v_ArrVal_3257 Int) (v_ArrVal_3243 Int) (v_ArrVal_3249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (v_ArrVal_3253 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int) (v_ArrVal_3251 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3242))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_~#queue~0.offset|) v_ArrVal_3243) .cse6 v_ArrVal_3245))) (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3249))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_3251) .cse6 v_ArrVal_3253))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| (select .cse2 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse3 .cse1)))))))))) is different from false [2022-03-02 00:50:30,411 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3238 Int) (v_ArrVal_3245 Int) (v_ArrVal_3257 Int) (v_ArrVal_3243 Int) (v_ArrVal_3253 Int) (v_ArrVal_3251 Int) (v_ArrVal_3242 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3238)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3242))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_~#queue~0.offset|) v_ArrVal_3243) .cse6 v_ArrVal_3245))) (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3249))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_3251) .cse6 v_ArrVal_3253))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| (select .cse3 .cse1))) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1)))))))))) is different from false [2022-03-02 00:50:30,749 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3238 Int) (v_ArrVal_3236 Int) (v_ArrVal_3245 Int) (v_ArrVal_3257 Int) (v_ArrVal_3243 Int) (v_ArrVal_3253 Int) (v_ArrVal_3251 Int) (v_ArrVal_3242 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (store (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_3236) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3238)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3242))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_~#queue~0.offset|) v_ArrVal_3243) .cse6 v_ArrVal_3245))) (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3249))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_3251) .cse6 v_ArrVal_3253))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse0 .cse1)))))))))) is different from false [2022-03-02 00:50:31,002 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)))) (forall ((v_ArrVal_3238 Int) (v_ArrVal_3236 Int) (v_ArrVal_3245 Int) (v_ArrVal_3257 Int) (v_ArrVal_3243 Int) (v_ArrVal_3253 Int) (v_ArrVal_3251 Int) (v_ArrVal_3242 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3236) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3238)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3242))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_~#queue~0.offset|) v_ArrVal_3243) .cse6 v_ArrVal_3245))) (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3249))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_3251) .cse6 v_ArrVal_3253))) (store .cse5 .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| (select .cse2 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse3 .cse1)))))))))))) is different from false [2022-03-02 00:50:31,498 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3238 Int) (v_ArrVal_3236 Int) (v_ArrVal_3245 Int) (v_ArrVal_3257 Int) (v_ArrVal_3243 Int) (v_ArrVal_3253 Int) (v_ArrVal_3251 Int) (v_ArrVal_3242 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int)) (let ((.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse11 (store (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_3236) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_3238))) (store .cse11 .cse5 (+ (select .cse11 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3242))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse9 |c_~#queue~0.base|)) (.cse8 (+ 88 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_~#queue~0.offset|) v_ArrVal_3243) .cse8 v_ArrVal_3245))) (store .cse10 .cse1 (+ (select .cse10 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3249))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|))) (let ((.cse3 (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_3251) .cse8 v_ArrVal_3253))) (store .cse7 .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| (select .cse2 .cse1))) (not (= (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| (select .cse4 .cse5))))))))))) is different from false [2022-03-02 00:50:31,923 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3238 Int) (v_ArrVal_3236 Int) (v_ArrVal_3245 Int) (v_ArrVal_3257 Int) (v_ArrVal_3243 Int) (v_ArrVal_3253 Int) (v_ArrVal_3251 Int) (v_ArrVal_3242 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse7 (+ 88 |c_~#queue~0.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse10 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| 4) |c_~#queue~0.offset|) v_ArrVal_3236) .cse7 v_ArrVal_3238))) (store .cse10 .cse1 (+ (select .cse10 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3242))) (let ((.cse2 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_~#queue~0.offset|) v_ArrVal_3243) .cse7 v_ArrVal_3245))) (store .cse9 .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3249))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_3251) .cse7 v_ArrVal_3253))) (store .cse6 .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| (select .cse2 .cse1))) (not (= (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse3 .cse1))))))))))) is different from false [2022-03-02 00:50:33,604 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3238 Int) (v_ArrVal_3236 Int) (v_ArrVal_3245 Int) (v_ArrVal_3257 Int) (v_ArrVal_3243 Int) (v_ArrVal_3253 Int) (v_ArrVal_3251 Int) (v_ArrVal_3242 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| Int) (v_ArrVal_3256 (Array Int Int)) (v_ArrVal_3235 (Array Int Int)) (v_ArrVal_3249 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| Int)) (let ((.cse10 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3235))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (select .cse10 |c_~#queue~0.base|)) (.cse7 (+ 88 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| 4) |c_~#queue~0.offset|) v_ArrVal_3236) .cse7 v_ArrVal_3238))) (store .cse11 .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3242))) (let ((.cse2 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| 4) |c_~#queue~0.offset|) v_ArrVal_3243) .cse7 v_ArrVal_3245))) (store .cse9 .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3249))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| 4) |c_~#queue~0.offset|) v_ArrVal_3251) .cse7 v_ArrVal_3253))) (store .cse6 .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3256) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_321| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_324| (select .cse3 .cse1))) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_315| 4) |c_~#queue~0.offset|) v_ArrVal_3257) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_318| (select .cse4 .cse1)))))))))))) is different from false [2022-03-02 00:50:34,358 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-02 00:50:34,359 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 2324 treesize of output 1664 [2022-03-02 00:50:34,390 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-02 00:50:34,390 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2319 treesize of output 2293 [2022-03-02 00:50:34,409 INFO L387 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 2053 treesize of output 1989 [2022-03-02 00:50:34,422 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-02 00:50:34,429 INFO L387 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 2473 treesize of output 2425 [2022-03-02 00:50:34,478 INFO L387 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 9167 treesize of output 9131 [2022-03-02 00:50:34,532 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-02 00:50:34,549 INFO L387 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 9371 treesize of output 9339 [2022-03-02 00:50:34,772 INFO L387 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-03-02 00:50:36,041 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-02 00:50:36,042 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12334 treesize of output 12250 [2022-03-02 00:50:36,076 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-03-02 00:50:36,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-02 00:50:36,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-02 00:50:36,280 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-03-02 00:50:36,284 INFO L158 Benchmark]: Toolchain (without parser) took 132469.03ms. Allocated memory was 170.9MB in the beginning and 814.7MB in the end (delta: 643.8MB). Free memory was 110.1MB in the beginning and 400.6MB in the end (delta: -290.5MB). Peak memory consumption was 625.6MB. Max. memory is 8.0GB. [2022-03-02 00:50:36,284 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 170.9MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-02 00:50:36,284 INFO L158 Benchmark]: CACSL2BoogieTranslator took 534.46ms. Allocated memory was 170.9MB in the beginning and 228.6MB in the end (delta: 57.7MB). Free memory was 141.4MB in the beginning and 179.1MB in the end (delta: -37.8MB). Peak memory consumption was 23.7MB. Max. memory is 8.0GB. [2022-03-02 00:50:36,285 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.86ms. Allocated memory is still 228.6MB. Free memory was 179.1MB in the beginning and 176.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-02 00:50:36,285 INFO L158 Benchmark]: Boogie Preprocessor took 50.37ms. Allocated memory is still 228.6MB. Free memory was 176.5MB in the beginning and 174.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-02 00:50:36,285 INFO L158 Benchmark]: RCFGBuilder took 506.57ms. Allocated memory is still 228.6MB. Free memory was 174.4MB in the beginning and 155.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-03-02 00:50:36,285 INFO L158 Benchmark]: TraceAbstraction took 131289.48ms. Allocated memory was 228.6MB in the beginning and 814.7MB in the end (delta: 586.2MB). Free memory was 155.0MB in the beginning and 400.6MB in the end (delta: -245.6MB). Peak memory consumption was 612.9MB. Max. memory is 8.0GB. [2022-03-02 00:50:36,287 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 170.9MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 534.46ms. Allocated memory was 170.9MB in the beginning and 228.6MB in the end (delta: 57.7MB). Free memory was 141.4MB in the beginning and 179.1MB in the end (delta: -37.8MB). Peak memory consumption was 23.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.86ms. Allocated memory is still 228.6MB. Free memory was 179.1MB in the beginning and 176.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.37ms. Allocated memory is still 228.6MB. Free memory was 176.5MB in the beginning and 174.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 506.57ms. Allocated memory is still 228.6MB. Free memory was 174.4MB in the beginning and 155.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 131289.48ms. Allocated memory was 228.6MB in the beginning and 814.7MB in the end (delta: 586.2MB). Free memory was 155.0MB in the beginning and 400.6MB in the end (delta: -245.6MB). Peak memory consumption was 612.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-03-02 00:50:36,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2022-03-02 00:50:36,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...