/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/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE --traceabstraction.maximal.amount.of.steps.the.threads.are.allowed.to.take.successively 1 --traceabstraction.enable.heuristic.with.loops.as.step.type false --traceabstraction.considered.threads.and.their.maximal.amount.of.steps '"3,2 1,1 2,2"' --traceabstraction.defines.what.statements.are.considered.a.step.in.por LOOP -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-218013a [2023-05-04 11:05:44,722 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 11:05:44,724 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 11:05:44,748 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 11:05:44,748 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 11:05:44,749 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 11:05:44,751 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 11:05:44,752 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 11:05:44,760 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 11:05:44,761 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 11:05:44,761 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 11:05:44,765 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 11:05:44,765 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 11:05:44,767 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 11:05:44,768 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 11:05:44,769 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 11:05:44,770 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 11:05:44,771 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 11:05:44,772 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 11:05:44,773 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 11:05:44,782 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 11:05:44,785 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 11:05:44,786 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 11:05:44,787 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 11:05:44,789 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 11:05:44,790 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 11:05:44,790 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 11:05:44,791 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 11:05:44,791 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 11:05:44,792 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 11:05:44,792 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 11:05:44,792 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 11:05:44,793 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 11:05:44,794 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 11:05:44,794 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 11:05:44,795 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 11:05:44,795 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 11:05:44,795 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 11:05:44,795 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 11:05:44,796 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 11:05:44,802 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 11:05:44,803 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 11:05:44,837 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 11:05:44,838 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 11:05:44,838 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 11:05:44,838 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 11:05:44,839 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 11:05:44,839 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 11:05:44,840 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 11:05:44,840 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 11:05:44,840 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 11:05:44,840 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 11:05:44,841 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 11:05:44,841 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 11:05:44,841 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 11:05:44,842 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 11:05:44,842 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 11:05:44,842 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 11:05:44,842 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 11:05:44,842 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 11:05:44,842 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 11:05:44,842 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 11:05:44,842 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 11:05:44,843 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 11:05:44,843 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 11:05:44,844 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 11:05:44,844 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 11:05:44,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 11:05:44,844 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 11:05:44,845 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 11:05:44,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 11:05:44,845 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 11:05:44,845 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 11:05:44,845 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 11:05:44,845 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 11:05:44,845 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 11:05:44,846 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 11:05:44,846 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 11:05:44,846 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Maximal amount of steps the threads are allowed to take successively -> 1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Enable heuristic with loops as step type -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Considered threads and their maximal amount of steps -> 3,2 1,1 2,2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> LOOP [2023-05-04 11:05:45,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 11:05:45,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 11:05:45,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 11:05:45,124 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-04 11:05:45,125 INFO L275 PluginConnector]: CDTParser initialized [2023-05-04 11:05:45,126 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2023-05-04 11:05:45,198 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07a61119f/b424ddf228654175856d827810ddc0f4/FLAG35e35ebd5 [2023-05-04 11:05:45,686 INFO L306 CDTParser]: Found 1 translation units. [2023-05-04 11:05:45,686 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2023-05-04 11:05:45,712 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07a61119f/b424ddf228654175856d827810ddc0f4/FLAG35e35ebd5 [2023-05-04 11:05:46,021 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07a61119f/b424ddf228654175856d827810ddc0f4 [2023-05-04 11:05:46,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 11:05:46,026 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-04 11:05:46,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-04 11:05:46,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-04 11:05:46,030 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-04 11:05:46,030 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 11:05:46" (1/1) ... [2023-05-04 11:05:46,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e48fc99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:05:46, skipping insertion in model container [2023-05-04 11:05:46,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 11:05:46" (1/1) ... [2023-05-04 11:05:46,037 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-04 11:05:46,076 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-04 11:05:46,238 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-05-04 11:05:46,504 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-divine/ring_2w1r-1.i[39095,39108] [2023-05-04 11:05:46,508 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-divine/ring_2w1r-1.i[39180,39193] [2023-05-04 11:05:46,509 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-divine/ring_2w1r-1.i[39232,39245] [2023-05-04 11:05:46,569 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-divine/ring_2w1r-1.i[49388,49401] [2023-05-04 11:05:46,570 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-divine/ring_2w1r-1.i[49437,49450] [2023-05-04 11:05:46,573 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-divine/ring_2w1r-1.i[49565,49578] [2023-05-04 11:05:46,574 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-divine/ring_2w1r-1.i[49623,49636] [2023-05-04 11:05:46,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 11:05:46,590 INFO L203 MainTranslator]: Completed pre-run [2023-05-04 11:05:46,603 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-05-04 11:05:46,622 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-divine/ring_2w1r-1.i[39095,39108] [2023-05-04 11:05:46,623 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-divine/ring_2w1r-1.i[39180,39193] [2023-05-04 11:05:46,624 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-divine/ring_2w1r-1.i[39232,39245] [2023-05-04 11:05:46,633 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-divine/ring_2w1r-1.i[49388,49401] [2023-05-04 11:05:46,634 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-divine/ring_2w1r-1.i[49437,49450] [2023-05-04 11:05:46,635 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-divine/ring_2w1r-1.i[49565,49578] [2023-05-04 11:05:46,636 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-divine/ring_2w1r-1.i[49623,49636] [2023-05-04 11:05:46,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 11:05:46,706 INFO L208 MainTranslator]: Completed translation [2023-05-04 11:05:46,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:05:46 WrapperNode [2023-05-04 11:05:46,708 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-04 11:05:46,709 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 11:05:46,710 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 11:05:46,710 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 11:05:46,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:05:46" (1/1) ... [2023-05-04 11:05:46,749 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:05:46" (1/1) ... [2023-05-04 11:05:46,788 INFO L138 Inliner]: procedures = 310, calls = 70, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 203 [2023-05-04 11:05:46,788 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 11:05:46,789 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 11:05:46,790 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 11:05:46,790 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 11:05:46,799 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:05:46" (1/1) ... [2023-05-04 11:05:46,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:05:46" (1/1) ... [2023-05-04 11:05:46,815 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:05:46" (1/1) ... [2023-05-04 11:05:46,816 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:05:46" (1/1) ... [2023-05-04 11:05:46,823 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:05:46" (1/1) ... [2023-05-04 11:05:46,841 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:05:46" (1/1) ... [2023-05-04 11:05:46,845 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:05:46" (1/1) ... [2023-05-04 11:05:46,846 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:05:46" (1/1) ... [2023-05-04 11:05:46,849 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 11:05:46,850 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 11:05:46,850 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 11:05:46,850 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 11:05:46,860 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:05:46" (1/1) ... [2023-05-04 11:05:46,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 11:05:46,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 11:05:46,890 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-05-04 11:05:46,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-05-04 11:05:46,921 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2023-05-04 11:05:46,921 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2023-05-04 11:05:46,921 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2023-05-04 11:05:46,922 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2023-05-04 11:05:46,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-04 11:05:46,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-04 11:05:46,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-04 11:05:46,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-04 11:05:46,922 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-05-04 11:05:46,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-04 11:05:46,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-04 11:05:46,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 11:05:46,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 11:05:46,924 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-04 11:05:47,072 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 11:05:47,074 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 11:05:47,409 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 11:05:47,421 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 11:05:47,421 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2023-05-04 11:05:47,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 11:05:47 BoogieIcfgContainer [2023-05-04 11:05:47,424 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 11:05:47,426 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 11:05:47,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 11:05:47,431 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 11:05:47,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 11:05:46" (1/3) ... [2023-05-04 11:05:47,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12644034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 11:05:47, skipping insertion in model container [2023-05-04 11:05:47,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:05:46" (2/3) ... [2023-05-04 11:05:47,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12644034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 11:05:47, skipping insertion in model container [2023-05-04 11:05:47,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 11:05:47" (3/3) ... [2023-05-04 11:05:47,435 INFO L112 eAbstractionObserver]: Analyzing ICFG ring_2w1r-1.i [2023-05-04 11:05:47,444 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 11:05:47,452 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 11:05:47,453 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-05-04 11:05:47,453 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 11:05:47,571 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-05-04 11:05:47,617 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 11:05:47,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 11:05:47,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 11:05:47,619 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) [2023-05-04 11:05:47,622 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 [2023-05-04 11:05:47,651 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 11:05:47,667 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-04 11:05:47,673 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7f7d1394, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 11:05:47,673 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-05-04 11:05:48,141 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-05-04 11:05:48,141 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-05-04 11:05:48,153 INFO L444 BasicCegarLoop]: Path program histogram: [] [2023-05-04 11:05:48,155 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE (1/2) [2023-05-04 11:05:48,176 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 11:05:48,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 11:05:48,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 11:05:48,178 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 11:05:48,184 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 11:05:48,186 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoThread1of1ForFork1 ======== [2023-05-04 11:05:48,187 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7f7d1394, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 11:05:48,187 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-05-04 11:05:48,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2023-05-04 11:05:48,373 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-05-04 11:05:48,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:05:48,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1284430472, now seen corresponding path program 1 times [2023-05-04 11:05:48,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:05:48,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418015222] [2023-05-04 11:05:48,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:05:48,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:05:48,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:05:48,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 11:05:48,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:05:48,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418015222] [2023-05-04 11:05:48,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418015222] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 11:05:48,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 11:05:48,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-04 11:05:48,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926321194] [2023-05-04 11:05:48,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 11:05:48,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-04 11:05:48,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:05:48,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-04 11:05:48,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-04 11:05:48,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:05:48,758 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:05:48,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 55.5) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 11:05:48,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:05:48,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:05:48,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 11:05:48,789 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-05-04 11:05:48,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:05:48,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1292189831, now seen corresponding path program 1 times [2023-05-04 11:05:48,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:05:48,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183223505] [2023-05-04 11:05:48,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:05:48,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:05:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:05:48,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 11:05:48,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:05:48,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183223505] [2023-05-04 11:05:48,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183223505] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 11:05:48,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 11:05:48,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 11:05:48,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379736129] [2023-05-04 11:05:48,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 11:05:48,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 11:05:48,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:05:48,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 11:05:48,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 11:05:48,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:05:48,957 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:05:48,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 11:05:48,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:05:48,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:05:49,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:05:49,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:05:49,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-04 11:05:49,059 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-05-04 11:05:49,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:05:49,060 INFO L85 PathProgramCache]: Analyzing trace with hash 13085267, now seen corresponding path program 1 times [2023-05-04 11:05:49,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:05:49,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858205073] [2023-05-04 11:05:49,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:05:49,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:05:49,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:05:50,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 11:05:50,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:05:50,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858205073] [2023-05-04 11:05:50,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858205073] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 11:05:50,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 11:05:50,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-05-04 11:05:50,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303153631] [2023-05-04 11:05:50,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 11:05:50,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-05-04 11:05:50,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:05:50,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-05-04 11:05:50,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2023-05-04 11:05:50,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:05:50,688 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:05:50,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.8) internal successors, (116), 20 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 11:05:50,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:05:50,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:05:50,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:05:52,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:05:52,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:05:52,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 11:05:52,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-05-04 11:05:52,612 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-05-04 11:05:52,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:05:52,612 INFO L85 PathProgramCache]: Analyzing trace with hash 161660449, now seen corresponding path program 1 times [2023-05-04 11:05:52,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:05:52,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978364045] [2023-05-04 11:05:52,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:05:52,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:05:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:05:52,728 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-05-04 11:05:52,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:05:52,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978364045] [2023-05-04 11:05:52,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978364045] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 11:05:52,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 11:05:52,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 11:05:52,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445349999] [2023-05-04 11:05:52,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 11:05:52,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 11:05:52,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:05:52,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 11:05:52,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 11:05:52,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:05:52,735 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:05:52,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 11:05:52,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:05:52,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:05:52,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 11:05:52,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:05:52,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:05:52,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:05:52,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 11:05:52,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:05:52,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-05-04 11:05:52,781 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-05-04 11:05:52,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:05:52,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1583947743, now seen corresponding path program 1 times [2023-05-04 11:05:52,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:05:52,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210020883] [2023-05-04 11:05:52,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:05:52,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:05:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:05:54,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 11:05:54,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:05:54,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210020883] [2023-05-04 11:05:54,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210020883] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 11:05:54,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 11:05:54,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2023-05-04 11:05:54,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466553665] [2023-05-04 11:05:54,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 11:05:54,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-05-04 11:05:54,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:05:54,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-05-04 11:05:54,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2023-05-04 11:05:54,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:05:54,402 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:05:54,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.304347826086956) internal successors, (145), 23 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 11:05:54,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:05:54,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:05:54,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 11:05:54,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:05:54,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:05:56,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:05:56,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:05:56,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 11:05:56,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:05:56,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 11:05:56,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-05-04 11:05:56,372 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-05-04 11:05:56,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:05:56,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1516093873, now seen corresponding path program 1 times [2023-05-04 11:05:56,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:05:56,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143855692] [2023-05-04 11:05:56,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:05:56,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:05:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:05:58,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 11:05:58,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:05:58,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143855692] [2023-05-04 11:05:58,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143855692] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 11:05:58,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 11:05:58,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2023-05-04 11:05:58,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360320559] [2023-05-04 11:05:58,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 11:05:58,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-05-04 11:05:58,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:05:58,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-05-04 11:05:58,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2023-05-04 11:05:58,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:05:58,201 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:05:58,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.241379310344827) internal successors, (123), 29 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 11:05:58,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:05:58,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:05:58,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 11:05:58,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:05:58,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 11:05:58,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:06:01,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:06:01,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:06:01,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 11:06:01,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:06:01,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 11:06:01,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 11:06:01,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-05-04 11:06:01,991 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-05-04 11:06:01,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:06:01,991 INFO L85 PathProgramCache]: Analyzing trace with hash -176037711, now seen corresponding path program 1 times [2023-05-04 11:06:01,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:06:01,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635285635] [2023-05-04 11:06:01,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:06:01,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:06:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:06:04,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 11:06:04,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:06:04,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635285635] [2023-05-04 11:06:04,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635285635] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 11:06:04,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 11:06:04,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2023-05-04 11:06:04,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935563676] [2023-05-04 11:06:04,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 11:06:04,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-05-04 11:06:04,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:06:04,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-05-04 11:06:04,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1173, Unknown=0, NotChecked=0, Total=1260 [2023-05-04 11:06:04,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:06:04,321 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:06:04,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.5) internal successors, (126), 36 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 11:06:04,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:06:04,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:06:04,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 11:06:04,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:06:04,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 11:06:04,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 11:06:04,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:06:08,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:06:08,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:06:08,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 11:06:08,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:06:08,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 11:06:08,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 11:06:08,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-05-04 11:06:08,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-05-04 11:06:08,500 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-05-04 11:06:08,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:06:08,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1162200118, now seen corresponding path program 1 times [2023-05-04 11:06:08,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:06:08,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056111984] [2023-05-04 11:06:08,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:06:08,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:06:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:06:11,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 11:06:11,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:06:11,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056111984] [2023-05-04 11:06:11,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056111984] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 11:06:11,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 11:06:11,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2023-05-04 11:06:11,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258810671] [2023-05-04 11:06:11,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 11:06:11,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-05-04 11:06:11,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:06:11,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-05-04 11:06:11,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1241, Unknown=0, NotChecked=0, Total=1332 [2023-05-04 11:06:11,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:06:11,026 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:06:11,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.4324324324324325) internal successors, (127), 37 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 11:06:11,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:06:11,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:06:11,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 11:06:11,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:06:11,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 11:06:11,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 11:06:11,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-05-04 11:06:11,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:06:15,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:06:15,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:06:15,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 11:06:15,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:06:15,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 11:06:15,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 11:06:15,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-05-04 11:06:15,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-05-04 11:06:15,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-05-04 11:06:15,917 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-05-04 11:06:15,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:06:15,918 INFO L85 PathProgramCache]: Analyzing trace with hash 386786638, now seen corresponding path program 1 times [2023-05-04 11:06:15,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:06:15,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660624540] [2023-05-04 11:06:15,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:06:15,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:06:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:06:16,007 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 36 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 11:06:16,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:06:16,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660624540] [2023-05-04 11:06:16,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660624540] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 11:06:16,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807888831] [2023-05-04 11:06:16,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:06:16,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 11:06:16,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 11:06:16,050 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 11:06:16,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-05-04 11:06:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:06:16,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 3 conjunts are in the unsatisfiable core [2023-05-04 11:06:16,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 11:06:16,382 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 36 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 11:06:16,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 11:06:16,497 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 36 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 11:06:16,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807888831] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 11:06:16,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 11:06:16,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-05-04 11:06:16,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327299360] [2023-05-04 11:06:16,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 11:06:16,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-04 11:06:16,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:06:16,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-04 11:06:16,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-05-04 11:06:16,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:06:16,500 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:06:16,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 49.857142857142854) internal successors, (349), 7 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 11:06:16,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:06:16,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:06:16,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 11:06:16,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:06:16,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 11:06:16,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 11:06:16,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2023-05-04 11:06:16,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-05-04 11:06:16,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:06:16,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:06:16,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:06:16,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 11:06:16,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:06:16,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 11:06:16,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 11:06:16,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-05-04 11:06:16,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-05-04 11:06:16,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-05-04 11:06:16,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-05-04 11:06:17,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 11:06:17,176 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-05-04 11:06:17,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:06:17,176 INFO L85 PathProgramCache]: Analyzing trace with hash -2035981334, now seen corresponding path program 1 times [2023-05-04 11:06:17,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:06:17,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267146853] [2023-05-04 11:06:17,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:06:17,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:06:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:06:17,292 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 11:06:17,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:06:17,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267146853] [2023-05-04 11:06:17,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267146853] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 11:06:17,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 11:06:17,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-05-04 11:06:17,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487607813] [2023-05-04 11:06:17,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 11:06:17,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-05-04 11:06:17,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:06:17,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-05-04 11:06:17,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-05-04 11:06:17,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:06:17,294 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:06:17,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.75) internal successors, (235), 4 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 11:06:17,294 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:06:17,294 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:06:17,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 11:06:17,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:06:17,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 11:06:17,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 11:06:17,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2023-05-04 11:06:17,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-05-04 11:06:17,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-05-04 11:06:17,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:06:17,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:06:17,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:06:17,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 11:06:17,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:06:17,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 11:06:17,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 11:06:17,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-05-04 11:06:17,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-05-04 11:06:17,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-05-04 11:06:17,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 11:06:17,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-05-04 11:06:17,363 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-05-04 11:06:17,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:06:17,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1963224141, now seen corresponding path program 1 times [2023-05-04 11:06:17,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:06:17,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311198950] [2023-05-04 11:06:17,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:06:17,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:06:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:06:17,458 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-05-04 11:06:17,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:06:17,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311198950] [2023-05-04 11:06:17,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311198950] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 11:06:17,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 11:06:17,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 11:06:17,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36632629] [2023-05-04 11:06:17,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 11:06:17,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 11:06:17,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:06:17,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 11:06:17,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 11:06:17,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:06:17,461 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:06:17,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 11:06:17,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:06:17,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:06:17,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 11:06:17,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:06:17,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 11:06:17,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 11:06:17,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2023-05-04 11:06:17,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-05-04 11:06:17,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-05-04 11:06:17,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 11:06:17,462 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:06:17,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:06:17,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:06:17,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 11:06:17,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:06:17,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 11:06:17,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 11:06:17,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-05-04 11:06:17,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-05-04 11:06:17,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 11:06:17,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 11:06:17,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:06:17,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-05-04 11:06:17,567 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-05-04 11:06:17,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:06:17,568 INFO L85 PathProgramCache]: Analyzing trace with hash 881965946, now seen corresponding path program 1 times [2023-05-04 11:06:17,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:06:17,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586435068] [2023-05-04 11:06:17,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:06:17,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:06:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:06:17,802 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 39 proven. 178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 11:06:17,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:06:17,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586435068] [2023-05-04 11:06:17,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586435068] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 11:06:17,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649705566] [2023-05-04 11:06:17,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:06:17,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 11:06:17,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 11:06:17,805 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 11:06:17,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-05-04 11:06:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:06:17,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 6 conjunts are in the unsatisfiable core [2023-05-04 11:06:18,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 11:06:18,233 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 39 proven. 178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 11:06:18,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 11:06:18,476 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 39 proven. 178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 11:06:18,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649705566] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 11:06:18,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 11:06:18,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-05-04 11:06:18,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376165525] [2023-05-04 11:06:18,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 11:06:18,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-05-04 11:06:18,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:06:18,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-05-04 11:06:18,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2023-05-04 11:06:18,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:06:18,479 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:06:18,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 48.18181818181818) internal successors, (530), 11 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 11:06:18,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:06:18,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:06:18,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 11:06:18,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:06:18,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 11:06:18,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 11:06:18,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2023-05-04 11:06:18,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-05-04 11:06:18,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-04 11:06:18,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 11:06:18,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:06:18,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:06:18,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:06:18,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:06:18,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 11:06:18,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:06:18,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 11:06:18,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 11:06:18,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-05-04 11:06:18,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-05-04 11:06:18,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 11:06:18,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 11:06:18,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:06:18,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-05-04 11:06:18,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-05-04 11:06:18,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 11:06:18,784 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-05-04 11:06:18,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:06:18,784 INFO L85 PathProgramCache]: Analyzing trace with hash -764371510, now seen corresponding path program 2 times [2023-05-04 11:06:18,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:06:18,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208650030] [2023-05-04 11:06:18,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:06:18,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:06:19,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:06:21,462 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 687 proven. 246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 11:06:21,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:06:21,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208650030] [2023-05-04 11:06:21,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208650030] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 11:06:21,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894167800] [2023-05-04 11:06:21,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 11:06:21,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 11:06:21,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 11:06:21,465 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 11:06:21,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-05-04 11:06:21,762 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 11:06:21,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 11:06:21,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 942 conjuncts, 76 conjunts are in the unsatisfiable core [2023-05-04 11:06:21,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 11:06:21,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-05-04 11:06:21,818 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-05-04 11:06:21,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-05-04 11:06:21,887 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-05-04 11:06:21,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-05-04 11:06:22,051 INFO L390 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 14 treesize of output 16 [2023-05-04 11:06:22,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 11:06:22,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-05-04 11:06:22,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-05-04 11:06:22,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-05-04 11:06:22,843 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-05-04 11:06:22,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2023-05-04 11:06:23,201 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 11:06:23,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-05-04 11:06:24,536 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 667 proven. 266 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 11:06:24,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 11:06:25,473 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_630 Int) (v_ArrVal_628 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| v_ArrVal_628) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_630) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|) 1) (< |reader_twoThread1of1ForFork1_~val~1#1| 7))) is different from false [2023-05-04 11:06:25,656 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_630 Int) (v_ArrVal_627 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_627) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_628) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_630) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|) 1) (< |reader_twoThread1of1ForFork1_~val~1#1| 7))) is different from false [2023-05-04 11:06:28,005 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_630 Int) (v_ArrVal_627 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_627) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_628) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_630) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|) 1) (< |reader_twoThread1of1ForFork1_~val~1#1| 7))) is different from false [2023-05-04 11:06:28,049 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_630 Int) (v_ArrVal_627 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~arg#1.base| v_ArrVal_627) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_628) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_630) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|) 1) (< |reader_twoThread1of1ForFork1_~val~1#1| 7))) is different from false [2023-05-04 11:06:30,201 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_630 Int) (v_ArrVal_627 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_627) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_628) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_630) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|) 1) (< |reader_twoThread1of1ForFork1_~val~1#1| 7))) is different from false [2023-05-04 11:06:40,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 370 treesize of output 364 [2023-05-04 11:06:40,475 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 11:06:40,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 294 treesize of output 278 [2023-05-04 11:06:40,483 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 11:06:40,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 119 [2023-05-04 11:06:40,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 256 [2023-05-04 11:06:40,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 266 [2023-05-04 11:06:41,028 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 817 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 102 not checked. [2023-05-04 11:06:41,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894167800] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 11:06:41,029 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 11:06:41,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 34, 29] total 85 [2023-05-04 11:06:41,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134146094] [2023-05-04 11:06:41,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 11:06:41,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2023-05-04 11:06:41,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:06:41,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2023-05-04 11:06:41,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=668, Invalid=5627, Unknown=45, NotChecked=800, Total=7140 [2023-05-04 11:06:41,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:06:41,034 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:06:41,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 12.529411764705882) internal successors, (1065), 85 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 11:06:41,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:06:41,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:06:41,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 11:06:41,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:06:41,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 11:06:41,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 11:06:41,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2023-05-04 11:06:41,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-05-04 11:06:41,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-04 11:06:41,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 11:06:41,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:06:41,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-05-04 11:06:41,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:06:43,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:06:43,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:06:43,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 11:06:43,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:06:43,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 11:06:43,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 11:06:43,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-05-04 11:06:43,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-05-04 11:06:43,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 11:06:43,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 11:06:43,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:06:43,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-05-04 11:06:43,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-05-04 11:06:43,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-05-04 11:06:43,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-05-04 11:06:43,317 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-05-04 11:06:43,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:06:43,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1793846079, now seen corresponding path program 3 times [2023-05-04 11:06:43,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:06:43,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909852023] [2023-05-04 11:06:43,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:06:43,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:06:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:06:49,461 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 291 proven. 600 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-05-04 11:06:49,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:06:49,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909852023] [2023-05-04 11:06:49,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909852023] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 11:06:49,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039061283] [2023-05-04 11:06:49,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-04 11:06:49,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 11:06:49,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 11:06:49,469 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 11:06:49,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-05-04 11:06:52,522 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2023-05-04 11:06:52,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 11:06:52,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 997 conjuncts, 90 conjunts are in the unsatisfiable core [2023-05-04 11:06:52,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 11:06:52,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-05-04 11:06:52,581 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-05-04 11:06:52,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-05-04 11:06:52,754 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-05-04 11:06:52,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-05-04 11:06:52,975 INFO L390 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 [2023-05-04 11:06:53,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-05-04 11:06:53,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-05-04 11:06:53,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-05-04 11:06:53,943 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-05-04 11:06:53,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 31 [2023-05-04 11:06:54,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-05-04 11:06:54,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-05-04 11:06:55,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-05-04 11:06:55,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-05-04 11:06:56,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-05-04 11:06:56,215 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-05-04 11:06:56,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 31 [2023-05-04 11:06:56,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-05-04 11:06:56,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-05-04 11:06:57,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-05-04 11:06:57,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-05-04 11:06:57,297 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 11:06:57,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-05-04 11:06:57,598 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 273 proven. 618 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-05-04 11:06:57,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 11:06:59,216 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_831 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_827 (Array Int Int)) (v_ArrVal_828 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 4) (< (select (select (store (store (let ((.cse0 (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_827))) (store .cse0 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store (select .cse0 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_828))) |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_831) |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_833) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| 4)) 1))) is different from false [2023-05-04 11:06:59,826 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_833 (Array Int Int)) (v_ArrVal_827 (Array Int Int)) (v_ArrVal_826 (Array Int Int)) (v_ArrVal_828 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 4) (< (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_826) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_827))) (store .cse0 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store (select .cse0 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_828))) |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_833) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| 4)) 1))) is different from false [2023-05-04 11:07:01,584 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_827 (Array Int Int)) (|v_reader_twoThread1of1ForFork1_~val~1#1_33| Int) (v_ArrVal_826 (Array Int Int)) (v_ArrVal_828 Int) (v_ArrVal_822 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |v_reader_twoThread1of1ForFork1_~val~1#1_33| 4) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< (select (select (store (let ((.cse0 (store (store (let ((.cse1 (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_820))) (store .cse1 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store (select .cse1 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_822))) |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_826) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_827))) (store .cse0 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store (select .cse0 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ (* |v_reader_twoThread1of1ForFork1_~val~1#1_33| 4) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4)) v_ArrVal_828))) |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_833) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| 4)) 1))) is different from false [2023-05-04 11:07:01,667 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_833 (Array Int Int)) (v_ArrVal_827 (Array Int Int)) (|v_reader_twoThread1of1ForFork1_~val~1#1_33| Int) (v_ArrVal_826 (Array Int Int)) (v_ArrVal_828 Int) (v_ArrVal_822 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |v_reader_twoThread1of1ForFork1_~val~1#1_33| 4) (< (select (select (store (let ((.cse0 (store (store (let ((.cse1 (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| v_ArrVal_820))) (store .cse1 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store (select .cse1 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_822))) |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_826) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_827))) (store .cse0 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store (select .cse0 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ (* |v_reader_twoThread1of1ForFork1_~val~1#1_33| 4) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4)) v_ArrVal_828))) |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_833) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| 4)) 1) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|))) is different from false [2023-05-04 11:07:02,563 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_833 (Array Int Int)) (|v_reader_twoThread1of1ForFork1_~val~1#1_33| Int) (v_ArrVal_827 (Array Int Int)) (v_ArrVal_826 (Array Int Int)) (v_ArrVal_828 Int) (v_ArrVal_819 (Array Int Int)) (v_ArrVal_822 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |v_reader_twoThread1of1ForFork1_~val~1#1_33| 4) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< (select (select (store (let ((.cse0 (store (store (let ((.cse1 (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_819))) (store .cse1 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store (select .cse1 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_822))) |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_826) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_827))) (store .cse0 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store (select .cse0 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ (* |v_reader_twoThread1of1ForFork1_~val~1#1_33| 4) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4)) v_ArrVal_828))) |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_833) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| 4)) 1))) is different from false [2023-05-04 11:07:04,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2120 treesize of output 2110 [2023-05-04 11:07:04,392 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 11:07:04,393 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 11:07:04,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1163 treesize of output 1147 [2023-05-04 11:07:04,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2458 treesize of output 2422 [2023-05-04 11:07:04,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2558 treesize of output 2542 [2023-05-04 11:07:04,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2542 treesize of output 2350 [2023-05-04 11:07:04,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2566 treesize of output 2470 [2023-05-04 11:07:04,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2578 treesize of output 2530 [2023-05-04 11:07:05,324 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 384 proven. 391 refuted. 33 times theorem prover too weak. 0 trivial. 101 not checked. [2023-05-04 11:07:05,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039061283] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 11:07:05,325 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 11:07:05,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 43, 45] total 131 [2023-05-04 11:07:05,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748742337] [2023-05-04 11:07:05,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 11:07:05,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 131 states [2023-05-04 11:07:05,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:07:05,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2023-05-04 11:07:05,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=756, Invalid=14745, Unknown=269, NotChecked=1260, Total=17030 [2023-05-04 11:07:05,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:07:05,331 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:07:05,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 131 states, 131 states have (on average 8.702290076335878) internal successors, (1140), 131 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 11:07:05,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:07:05,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:07:05,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 11:07:05,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:07:05,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 11:07:05,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 11:07:05,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2023-05-04 11:07:05,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-05-04 11:07:05,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-04 11:07:05,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 11:07:05,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:07:05,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-05-04 11:07:05,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-05-04 11:07:05,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:07:14,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:07:14,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:07:14,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 11:07:14,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:07:14,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 11:07:14,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 11:07:14,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-05-04 11:07:14,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-05-04 11:07:14,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 11:07:14,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 11:07:14,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:07:14,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-05-04 11:07:14,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-05-04 11:07:14,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-05-04 11:07:14,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-05-04 11:07:14,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 11:07:14,834 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-05-04 11:07:14,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:07:14,835 INFO L85 PathProgramCache]: Analyzing trace with hash 2009372753, now seen corresponding path program 1 times [2023-05-04 11:07:14,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:07:14,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829898353] [2023-05-04 11:07:14,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:07:14,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:07:15,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:07:21,899 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 47 proven. 744 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-05-04 11:07:21,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:07:21,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829898353] [2023-05-04 11:07:21,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829898353] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 11:07:21,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298453928] [2023-05-04 11:07:21,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:07:21,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 11:07:21,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 11:07:21,901 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 11:07:21,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-05-04 11:07:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:07:22,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 978 conjuncts, 112 conjunts are in the unsatisfiable core [2023-05-04 11:07:22,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 11:07:22,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-05-04 11:07:22,214 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-05-04 11:07:22,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-05-04 11:07:22,397 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-05-04 11:07:22,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-05-04 11:07:22,541 INFO L390 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 14 treesize of output 16 [2023-05-04 11:07:23,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 11:07:23,003 INFO L390 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 14 treesize of output 16 [2023-05-04 11:07:23,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-05-04 11:07:23,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-05-04 11:07:23,446 INFO L356 Elim1Store]: treesize reduction 14, result has 63.2 percent of original size [2023-05-04 11:07:23,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 44 [2023-05-04 11:07:24,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 11:07:24,364 INFO L390 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 33 treesize of output 33 [2023-05-04 11:07:24,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2023-05-04 11:07:24,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 11:07:24,961 INFO L390 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 14 treesize of output 16 [2023-05-04 11:07:24,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-05-04 11:07:25,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-05-04 11:07:25,640 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-05-04 11:07:25,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2023-05-04 11:07:25,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 11:07:25,892 INFO L390 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 20 treesize of output 22 [2023-05-04 11:07:25,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-05-04 11:07:26,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 11:07:26,612 INFO L390 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 27 treesize of output 27 [2023-05-04 11:07:26,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2023-05-04 11:07:27,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 11:07:27,107 INFO L390 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 14 treesize of output 16 [2023-05-04 11:07:27,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-05-04 11:07:27,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 11:07:27,304 INFO L390 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 14 treesize of output 16 [2023-05-04 11:07:27,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-05-04 11:07:27,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-05-04 11:07:27,952 INFO L356 Elim1Store]: treesize reduction 14, result has 63.2 percent of original size [2023-05-04 11:07:27,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 44 [2023-05-04 11:07:28,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-05-04 11:07:28,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-05-04 11:07:28,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-05-04 11:07:28,268 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 0 proven. 791 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-05-04 11:07:28,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 11:07:28,341 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_1049) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |c_reader_twoThread1of1ForFork1_~i~3#1| 4))) 3)) is different from false [2023-05-04 11:07:29,798 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1046 Int) (v_ArrVal_1045 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse2 (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| v_ArrVal_1045))) (let ((.cse0 (select .cse2 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse1 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1046) (< (select (select (store (store .cse2 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store .cse0 .cse1 v_ArrVal_1046)) |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_1049) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|) 3))))) is different from false [2023-05-04 11:07:29,817 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1046 Int) (v_ArrVal_1045 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse2 (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1045))) (let ((.cse0 (select .cse2 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse1 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1046) (< (select (select (store (store .cse2 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store .cse0 .cse1 v_ArrVal_1046)) |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_1049) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|) 3))))) is different from false [2023-05-04 11:07:29,921 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1046 Int) (v_ArrVal_1045 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse0 (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1045))) (let ((.cse1 (select .cse0 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse2 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (or (< (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store .cse1 .cse2 v_ArrVal_1046)) |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| v_ArrVal_1049) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|) 3) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1046))))) is different from false [2023-05-04 11:07:32,160 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1046 Int) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse0 (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_1044) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1045))) (let ((.cse1 (select .cse0 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse2 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (or (< (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store .cse1 .cse2 v_ArrVal_1046)) |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1049) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|) 3) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1046))))) is different from false [2023-05-04 11:07:32,261 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1046 Int) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse2 (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| v_ArrVal_1044) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1045))) (let ((.cse0 (select .cse2 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse1 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1046) (< (select (select (store (store .cse2 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store .cse0 .cse1 v_ArrVal_1046)) |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1049) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|) 3))))) is different from false [2023-05-04 11:07:32,281 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1046 Int) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse2 (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1044) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1045))) (let ((.cse0 (select .cse2 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse1 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1046) (< (select (select (store (store .cse2 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store .cse0 .cse1 v_ArrVal_1046)) |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1049) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|) 3))))) is different from false [2023-05-04 11:07:33,015 WARN L833 $PredicateComparison]: unable to prove that (or (not (< |c_reader_twoThread1of1ForFork1_~i~3#1| |c_reader_twoThread1of1ForFork1_~val~1#1|)) (forall ((v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1046 Int) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int)) (|v_reader_twoThread1of1ForFork1_~val~1#1_38| Int)) (let ((.cse0 (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1044) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1045))) (let ((.cse1 (select .cse0 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse2 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* |v_reader_twoThread1of1ForFork1_~val~1#1_38| 4)))) (or (< (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store .cse1 .cse2 v_ArrVal_1046)) |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1049) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|) 3) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1046)))))) is different from false [2023-05-04 11:07:33,110 WARN L833 $PredicateComparison]: unable to prove that (or (not (< |c_reader_twoThread1of1ForFork1_~i~3#1| |c_reader_twoThread1of1ForFork1_~val~1#1|)) (forall ((v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1046 Int) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int)) (|v_reader_twoThread1of1ForFork1_~val~1#1_38| Int) (v_ArrVal_1040 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_1040) |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1044) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1045))) (let ((.cse1 (select .cse0 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse2 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* |v_reader_twoThread1of1ForFork1_~val~1#1_38| 4)))) (or (< (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store .cse1 .cse2 v_ArrVal_1046)) |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1049) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|) 3) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1046)))))) is different from false [2023-05-04 11:07:37,493 WARN L833 $PredicateComparison]: unable to prove that (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1046 Int) (v_ArrVal_1036 Int) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int)) (|v_reader_twoThread1of1ForFork1_~val~1#1_38| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_1036)) |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_1038))) (let ((.cse0 (store (store .cse3 |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1044) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1045))) (let ((.cse1 (select .cse0 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse2 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* |v_reader_twoThread1of1ForFork1_~val~1#1_38| 4)))) (or (< (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store .cse1 .cse2 v_ArrVal_1046)) |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1049) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|) 3) (< 2 (select (select .cse3 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1046)))))))) is different from false [2023-05-04 11:07:37,663 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1046 Int) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1036 Int) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int)) (|v_reader_twoThread1of1ForFork1_~val~1#1_38| Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse0 (store (let ((.cse4 (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_1034))) (store .cse4 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store (select .cse4 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_1036))) |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_1038))) (let ((.cse1 (store (store .cse0 |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1044) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1045))) (let ((.cse2 (select .cse1 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse3 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* |v_reader_twoThread1of1ForFork1_~val~1#1_38| 4)))) (or (< 2 (select (select .cse0 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (< (select (select (store (store .cse1 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store .cse2 .cse3 v_ArrVal_1046)) |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1049) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|) 3) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1046)))))) is different from false [2023-05-04 11:07:37,761 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1046 Int) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1036 Int) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int)) (|v_reader_twoThread1of1ForFork1_~val~1#1_38| Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse2 (store (let ((.cse4 (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| v_ArrVal_1034))) (store .cse4 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store (select .cse4 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_1036))) |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_1038))) (let ((.cse3 (store (store .cse2 |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1044) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1045))) (let ((.cse0 (select .cse3 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse1 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* |v_reader_twoThread1of1ForFork1_~val~1#1_38| 4)))) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (< (+ (select .cse0 .cse1) 1) v_ArrVal_1046) (< 2 (select (select .cse2 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (< (select (select (store (store .cse3 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store .cse0 .cse1 v_ArrVal_1046)) |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1049) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|) 3)))))) is different from false [2023-05-04 11:07:37,804 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1046 Int) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1036 Int) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int)) (|v_reader_twoThread1of1ForFork1_~val~1#1_38| Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse3 (store (let ((.cse4 (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1034))) (store .cse4 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store (select .cse4 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_1036))) |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_1038))) (let ((.cse0 (store (store .cse3 |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1044) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1045))) (let ((.cse1 (select .cse0 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse2 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* |v_reader_twoThread1of1ForFork1_~val~1#1_38| 4)))) (or (< (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store .cse1 .cse2 v_ArrVal_1046)) |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1049) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|) 3) (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1046) (< 2 (select (select .cse3 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2023-05-04 11:07:38,099 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1046 Int) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1036 Int) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int)) (|v_reader_twoThread1of1ForFork1_~val~1#1_38| Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse0 (store (let ((.cse4 (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1034))) (store .cse4 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store (select .cse4 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_1036))) |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| v_ArrVal_1038))) (let ((.cse1 (store (store .cse0 |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1044) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1045))) (let ((.cse2 (select .cse1 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse3 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* |v_reader_twoThread1of1ForFork1_~val~1#1_38| 4)))) (or (< 2 (select (select .cse0 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (< (select (select (store (store .cse1 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store .cse2 .cse3 v_ArrVal_1046)) |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1049) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|) 3) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1046)))))) is different from false [2023-05-04 11:07:38,130 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1046 Int) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1036 Int) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int)) (|v_reader_twoThread1of1ForFork1_~val~1#1_38| Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse3 (let ((.cse4 (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1034))) (store .cse4 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store (select .cse4 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_1036))))) (let ((.cse2 (store (store .cse3 |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1044) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1045))) (let ((.cse0 (select .cse2 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse1 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* |v_reader_twoThread1of1ForFork1_~val~1#1_38| 4)))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1046) (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (< (select (select (store (store .cse2 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store .cse0 .cse1 v_ArrVal_1046)) |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1049) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|) 3) (< 2 (select (select (store .cse3 |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1038) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2023-05-04 11:07:38,308 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1046 Int) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1036 Int) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1044 (Array Int Int)) (|v_reader_twoThread1of1ForFork1_~val~1#1_38| Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse3 (let ((.cse4 (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_1033) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1034))) (store .cse4 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store (select .cse4 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_1036))))) (let ((.cse0 (store (store .cse3 |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1044) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1045))) (let ((.cse1 (select .cse0 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse2 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* |v_reader_twoThread1of1ForFork1_~val~1#1_38| 4)))) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (< (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store .cse1 .cse2 v_ArrVal_1046)) |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1049) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|) 3) (< 2 (select (select (store .cse3 |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1038) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1046)))))) is different from false [2023-05-04 11:07:40,931 WARN L833 $PredicateComparison]: unable to prove that (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (forall ((|v_reader_twoThread1of1ForFork1_~val~1#1_40| Int) (v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1046 Int) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1036 Int) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1044 (Array Int Int)) (|v_reader_twoThread1of1ForFork1_~val~1#1_38| Int) (v_ArrVal_1029 Int)) (let ((.cse0 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse1 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (let ((.cse4 (let ((.cse6 (store (store (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store .cse0 .cse1 v_ArrVal_1029)) |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1033) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1034))) (store .cse6 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store (select .cse6 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* |v_reader_twoThread1of1ForFork1_~val~1#1_40| 4)) v_ArrVal_1036))))) (let ((.cse5 (store (store .cse4 |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1044) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1045))) (let ((.cse2 (select .cse5 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse3 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* |v_reader_twoThread1of1ForFork1_~val~1#1_38| 4)))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1029) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1046) (< |v_reader_twoThread1of1ForFork1_~val~1#1_40| 2) (< 2 (select (select (store .cse4 |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1038) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (< (select (select (store (store .cse5 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store .cse2 .cse3 v_ArrVal_1046)) |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1049) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|) 3))))))))) is different from false [2023-05-04 11:07:41,217 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_reader_twoThread1of1ForFork1_~val~1#1_40| Int) (v_ArrVal_1027 (Array Int Int)) (v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1046 Int) (v_ArrVal_1036 Int) (|v_reader_twoThread1of1ForFork1_~val~1#1_38| Int) (v_ArrVal_1029 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse7 (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_1027))) (let ((.cse0 (select .cse7 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse1 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (let ((.cse4 (let ((.cse6 (store (store (store .cse7 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store .cse0 .cse1 v_ArrVal_1029)) |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1033) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1034))) (store .cse6 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store (select .cse6 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* |v_reader_twoThread1of1ForFork1_~val~1#1_40| 4)) v_ArrVal_1036))))) (let ((.cse5 (store (store .cse4 |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1044) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1045))) (let ((.cse2 (select .cse5 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse3 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* |v_reader_twoThread1of1ForFork1_~val~1#1_38| 4)))) (or (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< (+ (select .cse0 .cse1) 1) v_ArrVal_1029) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1046) (< 2 (select (select (store .cse4 |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1038) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (< |v_reader_twoThread1of1ForFork1_~val~1#1_40| 2) (< (select (select (store (store .cse5 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store .cse2 .cse3 v_ArrVal_1046)) |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1049) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|) 3)))))))) is different from false [2023-05-04 11:07:41,433 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_reader_twoThread1of1ForFork1_~val~1#1_40| Int) (v_ArrVal_1027 (Array Int Int)) (v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1046 Int) (v_ArrVal_1036 Int) (|v_reader_twoThread1of1ForFork1_~val~1#1_38| Int) (v_ArrVal_1029 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse7 (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| v_ArrVal_1027))) (let ((.cse2 (select .cse7 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse3 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (let ((.cse5 (let ((.cse6 (store (store (store .cse7 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store .cse2 .cse3 v_ArrVal_1029)) |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1033) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1034))) (store .cse6 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store (select .cse6 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* |v_reader_twoThread1of1ForFork1_~val~1#1_40| 4)) v_ArrVal_1036))))) (let ((.cse4 (store (store .cse5 |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1044) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1045))) (let ((.cse0 (select .cse4 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse1 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* |v_reader_twoThread1of1ForFork1_~val~1#1_38| 4)))) (or (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< (+ (select .cse0 .cse1) 1) v_ArrVal_1046) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1029) (< (select (select (store (store .cse4 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store .cse0 .cse1 v_ArrVal_1046)) |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1049) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|) 3) (< 2 (select (select (store .cse5 |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1038) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (< |v_reader_twoThread1of1ForFork1_~val~1#1_40| 2)))))))) is different from false [2023-05-04 11:07:41,532 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_reader_twoThread1of1ForFork1_~val~1#1_40| Int) (v_ArrVal_1027 (Array Int Int)) (v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1046 Int) (v_ArrVal_1036 Int) (|v_reader_twoThread1of1ForFork1_~val~1#1_38| Int) (v_ArrVal_1029 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse7 (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1027))) (let ((.cse0 (select .cse7 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse1 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (let ((.cse4 (let ((.cse6 (store (store (store .cse7 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store .cse0 .cse1 v_ArrVal_1029)) |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1033) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1034))) (store .cse6 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store (select .cse6 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* |v_reader_twoThread1of1ForFork1_~val~1#1_40| 4)) v_ArrVal_1036))))) (let ((.cse5 (store (store .cse4 |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1044) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1045))) (let ((.cse2 (select .cse5 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse3 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* |v_reader_twoThread1of1ForFork1_~val~1#1_38| 4)))) (or (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< (+ (select .cse0 .cse1) 1) v_ArrVal_1029) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1046) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< 2 (select (select (store .cse4 |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1038) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (< (select (select (store (store .cse5 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store .cse2 .cse3 v_ArrVal_1046)) |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1049) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|) 3) (< |v_reader_twoThread1of1ForFork1_~val~1#1_40| 2)))))))) is different from false [2023-05-04 11:07:41,878 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_reader_twoThread1of1ForFork1_~val~1#1_40| Int) (v_ArrVal_1027 (Array Int Int)) (v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1046 Int) (v_ArrVal_1036 Int) (|v_reader_twoThread1of1ForFork1_~val~1#1_38| Int) (v_ArrVal_1029 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse7 (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_1026) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1027))) (let ((.cse0 (select .cse7 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse1 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (let ((.cse2 (let ((.cse6 (store (store (store .cse7 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store .cse0 .cse1 v_ArrVal_1029)) |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1033) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1034))) (store .cse6 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store (select .cse6 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* |v_reader_twoThread1of1ForFork1_~val~1#1_40| 4)) v_ArrVal_1036))))) (let ((.cse3 (store (store .cse2 |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1044) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1045))) (let ((.cse4 (select .cse3 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse5 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* |v_reader_twoThread1of1ForFork1_~val~1#1_38| 4)))) (or (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< (+ (select .cse0 .cse1) 1) v_ArrVal_1029) (< 2 (select (select (store .cse2 |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1038) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (< (select (select (store (store .cse3 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store .cse4 .cse5 v_ArrVal_1046)) |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1049) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|) 3) (< |v_reader_twoThread1of1ForFork1_~val~1#1_40| 2) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1046)))))))) is different from false [2023-05-04 11:07:42,912 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_reader_twoThread1of1ForFork1_~val~1#1_40| Int) (v_ArrVal_1027 (Array Int Int)) (v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1046 Int) (v_ArrVal_1036 Int) (|v_reader_twoThread1of1ForFork1_~val~1#1_38| Int) (v_ArrVal_1029 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse7 (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_#in~r#1.base| v_ArrVal_1026) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1027))) (let ((.cse4 (select .cse7 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse5 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (let ((.cse0 (let ((.cse6 (store (store (store .cse7 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store .cse4 .cse5 v_ArrVal_1029)) |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1033) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1034))) (store .cse6 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store (select .cse6 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* |v_reader_twoThread1of1ForFork1_~val~1#1_40| 4)) v_ArrVal_1036))))) (let ((.cse3 (store (store .cse0 |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1044) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1045))) (let ((.cse1 (select .cse3 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse2 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* |v_reader_twoThread1of1ForFork1_~val~1#1_38| 4)))) (or (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< 2 (select (select (store .cse0 |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1038) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (< |v_reader_twoThread1of1ForFork1_~val~1#1_40| 2) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1046) (< (select (select (store (store .cse3 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store .cse1 .cse2 v_ArrVal_1046)) |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1049) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|) 3) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1029)))))))) is different from false [2023-05-04 11:07:42,985 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_reader_twoThread1of1ForFork1_~val~1#1_40| Int) (v_ArrVal_1027 (Array Int Int)) (v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1046 Int) (v_ArrVal_1036 Int) (|v_reader_twoThread1of1ForFork1_~val~1#1_38| Int) (v_ArrVal_1029 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse7 (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1026) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1027))) (let ((.cse4 (select .cse7 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse5 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (let ((.cse0 (let ((.cse6 (store (store (store .cse7 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store .cse4 .cse5 v_ArrVal_1029)) |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1033) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1034))) (store .cse6 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store (select .cse6 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* |v_reader_twoThread1of1ForFork1_~val~1#1_40| 4)) v_ArrVal_1036))))) (let ((.cse1 (store (store .cse0 |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1044) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1045))) (let ((.cse2 (select .cse1 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse3 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* |v_reader_twoThread1of1ForFork1_~val~1#1_38| 4)))) (or (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< 2 (select (select (store .cse0 |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1038) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (< (select (select (store (store .cse1 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store .cse2 .cse3 v_ArrVal_1046)) |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_1049) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|) 3) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< |v_reader_twoThread1of1ForFork1_~val~1#1_40| 2) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1029) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1046)))))))) is different from false [2023-05-04 11:07:43,192 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_reader_twoThread1of1ForFork1_~val~1#1_40| Int) (v_ArrVal_1027 (Array Int Int)) (v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1046 Int) (v_ArrVal_1036 Int) (|v_reader_twoThread1of1ForFork1_~val~1#1_38| Int) (v_ArrVal_1029 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse7 (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~arg#1.base| v_ArrVal_1026) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1027))) (let ((.cse3 (select .cse7 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse4 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (let ((.cse0 (let ((.cse6 (store (store (store .cse7 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store .cse3 .cse4 v_ArrVal_1029)) |c_writer_fnThread1of1ForFork0_~arg#1.base| v_ArrVal_1033) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1034))) (store .cse6 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store (select .cse6 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* |v_reader_twoThread1of1ForFork1_~val~1#1_40| 4)) v_ArrVal_1036))))) (let ((.cse5 (store (store .cse0 |c_writer_fnThread1of1ForFork0_~arg#1.base| v_ArrVal_1044) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1045))) (let ((.cse1 (select .cse5 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse2 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* |v_reader_twoThread1of1ForFork1_~val~1#1_38| 4)))) (or (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< 2 (select (select (store .cse0 |c_writer_fnThread1of1ForFork0_~arg#1.base| v_ArrVal_1038) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1046) (< |v_reader_twoThread1of1ForFork1_~val~1#1_40| 2) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1029) (< (select (select (store (store .cse5 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store .cse1 .cse2 v_ArrVal_1046)) |c_writer_fnThread1of1ForFork0_~arg#1.base| v_ArrVal_1049) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|) 3)))))))) is different from false [2023-05-04 11:07:43,234 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_reader_twoThread1of1ForFork1_~val~1#1_40| Int) (v_ArrVal_1027 (Array Int Int)) (v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1046 Int) (v_ArrVal_1036 Int) (|v_reader_twoThread1of1ForFork1_~val~1#1_38| Int) (v_ArrVal_1029 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse7 (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_1026) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1027))) (let ((.cse3 (select .cse7 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse4 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (let ((.cse2 (let ((.cse6 (store (store (store .cse7 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store .cse3 .cse4 v_ArrVal_1029)) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_1033) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1034))) (store .cse6 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store (select .cse6 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* |v_reader_twoThread1of1ForFork1_~val~1#1_40| 4)) v_ArrVal_1036))))) (let ((.cse5 (store (store .cse2 |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_1044) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1045))) (let ((.cse0 (select .cse5 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse1 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* |v_reader_twoThread1of1ForFork1_~val~1#1_38| 4)))) (or (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< (+ 1 (select .cse0 .cse1)) v_ArrVal_1046) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< |v_reader_twoThread1of1ForFork1_~val~1#1_40| 2) (< 2 (select (select (store .cse2 |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_1038) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (< (+ 1 (select .cse3 .cse4)) v_ArrVal_1029) (< (select (select (store (store .cse5 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store .cse0 .cse1 v_ArrVal_1046)) |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_1049) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|) 3)))))))) is different from false [2023-05-04 11:07:43,274 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_reader_twoThread1of1ForFork1_~val~1#1_40| Int) (v_ArrVal_1027 (Array Int Int)) (v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1046 Int) (v_ArrVal_1036 Int) (|v_reader_twoThread1of1ForFork1_~val~1#1_38| Int) (v_ArrVal_1029 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_1026) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1027))) (let ((.cse2 (select .cse7 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse3 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (let ((.cse4 (let ((.cse6 (store (store (store .cse7 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store .cse2 .cse3 v_ArrVal_1029)) |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_1033) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1034))) (store .cse6 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store (select .cse6 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* |v_reader_twoThread1of1ForFork1_~val~1#1_40| 4)) v_ArrVal_1036))))) (let ((.cse5 (store (store .cse4 |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_1044) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1045))) (let ((.cse0 (select .cse5 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse1 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* |v_reader_twoThread1of1ForFork1_~val~1#1_38| 4)))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1046) (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1029) (< 2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_1038) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)) (< (select (select (store (store .cse5 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store .cse0 .cse1 v_ArrVal_1046)) |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_1049) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|) 3) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< |v_reader_twoThread1of1ForFork1_~val~1#1_40| 2)))))))) is different from false [2023-05-04 11:07:43,316 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_reader_twoThread1of1ForFork1_~val~1#1_40| Int) (v_ArrVal_1027 (Array Int Int)) (v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1046 Int) (v_ArrVal_1036 Int) (|v_reader_twoThread1of1ForFork1_~val~1#1_38| Int) (v_ArrVal_1029 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (let ((.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1024) |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_1026) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1027))) (let ((.cse3 (select .cse7 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse4 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)))) (let ((.cse5 (let ((.cse6 (store (store (store .cse7 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store .cse3 .cse4 v_ArrVal_1029)) |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_1033) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1034))) (store .cse6 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store (select .cse6 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* |v_reader_twoThread1of1ForFork1_~val~1#1_40| 4)) v_ArrVal_1036))))) (let ((.cse0 (store (store .cse5 |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_1044) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_1045))) (let ((.cse1 (select .cse0 |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse2 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* |v_reader_twoThread1of1ForFork1_~val~1#1_38| 4)))) (or (< (select (select (store (store .cse0 |c_reader_twoThread1of1ForFork1_~#read~0#1.base| (store .cse1 .cse2 v_ArrVal_1046)) |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_1049) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|) 3) (not (< 0 |reader_twoThread1of1ForFork1_~val~1#1|)) (< 1 |reader_twoThread1of1ForFork1_~val~1#1|) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1029) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1046) (< |v_reader_twoThread1of1ForFork1_~val~1#1_40| 2) (< 2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_1038) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))))) is different from false [2023-05-04 11:07:43,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110525 treesize of output 110427 [2023-05-04 11:07:44,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 11:07:44,234 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 11:07:44,268 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 11:07:44,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 118997 treesize of output 118001 [2023-05-04 11:07:44,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 11:07:44,775 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 11:07:44,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 11:07:44,818 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 11:07:44,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53367 treesize of output 53097 [2023-05-04 11:07:45,204 INFO L356 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2023-05-04 11:07:45,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 158861 treesize of output 157789 [2023-05-04 11:07:46,246 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 11:07:46,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 148091 treesize of output 141477 [2023-05-04 11:07:46,834 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 11:07:46,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144779 treesize of output 141477 [2023-05-04 11:07:47,403 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 11:07:47,433 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 11:07:47,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158048 treesize of output 156298 [2023-05-04 11:07:48,033 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 11:07:48,060 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 11:07:48,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 156928 treesize of output 156058 [2023-05-04 11:07:48,711 INFO L356 Elim1Store]: treesize reduction 18, result has 45.5 percent of original size [2023-05-04 11:07:48,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 194965 treesize of output 194155 [2023-05-04 11:07:50,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134230 treesize of output 131286 [2023-05-04 11:07:50,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13710 treesize of output 13070 Received shutdown request... [2023-05-04 11:19:22,150 WARN L249 SmtUtils]: Removed 1 from assertion stack [2023-05-04 11:19:22,152 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-05-04 11:19:22,159 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 11:19:22,159 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 11:19:22,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-05-04 11:19:22,177 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 11:19:22,186 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 11:19:22,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 11:19:22,354 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 446 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. [2023-05-04 11:19:22,354 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-05-04 11:19:22,354 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-05-04 11:19:22,354 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-05-04 11:19:22,355 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-05-04 11:19:22,356 INFO L307 ceAbstractionStarter]: Result for error location reader_twoThread1of1ForFork1 was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (2/2) [2023-05-04 11:19:22,357 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-04 11:19:22,357 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-04 11:19:22,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.05 11:19:22 BasicIcfg [2023-05-04 11:19:22,360 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-04 11:19:22,360 INFO L158 Benchmark]: Toolchain (without parser) took 816334.46ms. Allocated memory was 218.1MB in the beginning and 978.3MB in the end (delta: 760.2MB). Free memory was 182.9MB in the beginning and 664.6MB in the end (delta: -481.7MB). Peak memory consumption was 635.2MB. Max. memory is 8.0GB. [2023-05-04 11:19:22,360 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 218.1MB. Free memory is still 171.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 11:19:22,361 INFO L158 Benchmark]: CACSL2BoogieTranslator took 681.13ms. Allocated memory was 218.1MB in the beginning and 271.6MB in the end (delta: 53.5MB). Free memory was 182.8MB in the beginning and 216.5MB in the end (delta: -33.7MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-05-04 11:19:22,361 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.76ms. Allocated memory is still 271.6MB. Free memory was 216.5MB in the beginning and 213.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-05-04 11:19:22,361 INFO L158 Benchmark]: Boogie Preprocessor took 59.63ms. Allocated memory is still 271.6MB. Free memory was 213.4MB in the beginning and 211.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-04 11:19:22,361 INFO L158 Benchmark]: RCFGBuilder took 574.21ms. Allocated memory is still 271.6MB. Free memory was 211.3MB in the beginning and 189.3MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-05-04 11:19:22,362 INFO L158 Benchmark]: TraceAbstraction took 814934.11ms. Allocated memory was 271.6MB in the beginning and 978.3MB in the end (delta: 706.7MB). Free memory was 188.2MB in the beginning and 664.6MB in the end (delta: -476.4MB). Peak memory consumption was 587.6MB. Max. memory is 8.0GB. [2023-05-04 11:19:22,363 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 218.1MB. Free memory is still 171.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 681.13ms. Allocated memory was 218.1MB in the beginning and 271.6MB in the end (delta: 53.5MB). Free memory was 182.8MB in the beginning and 216.5MB in the end (delta: -33.7MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 79.76ms. Allocated memory is still 271.6MB. Free memory was 216.5MB in the beginning and 213.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 59.63ms. Allocated memory is still 271.6MB. Free memory was 213.4MB in the beginning and 211.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 574.21ms. Allocated memory is still 271.6MB. Free memory was 211.3MB in the beginning and 189.3MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 814934.11ms. Allocated memory was 271.6MB in the beginning and 978.3MB in the end (delta: 706.7MB). Free memory was 188.2MB in the beginning and 664.6MB in the end (delta: -476.4MB). Peak memory consumption was 587.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8503, independent: 8397, independent conditional: 143, independent unconditional: 8254, dependent: 106, dependent conditional: 39, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8482, independent: 8397, independent conditional: 143, independent unconditional: 8254, dependent: 85, dependent conditional: 18, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8482, independent: 8397, independent conditional: 143, independent unconditional: 8254, dependent: 85, dependent conditional: 18, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8482, independent: 8397, independent conditional: 0, independent unconditional: 8397, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8482, independent: 8397, independent conditional: 0, independent unconditional: 8397, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8482, independent: 8397, independent conditional: 0, independent unconditional: 8397, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7913, independent: 7846, independent conditional: 0, independent unconditional: 7846, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7913, independent: 7845, independent conditional: 0, independent unconditional: 7845, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 68, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 68, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 204, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 163, dependent conditional: 0, dependent unconditional: 163, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8482, independent: 551, independent conditional: 0, independent unconditional: 551, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 7913, unknown conditional: 0, unknown unconditional: 7913] , Statistics on independence cache: Total cache size (in pairs): 7913, Positive cache size: 7846, Positive conditional cache size: 0, Positive unconditional cache size: 7846, Negative cache size: 67, Negative conditional cache size: 0, Negative unconditional cache size: 67, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 21 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, Number of persistent set computation: 199, Number of trivial persistent sets: 183, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8321, independent: 8254, independent conditional: 0, independent unconditional: 8254, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8503, independent: 8397, independent conditional: 143, independent unconditional: 8254, dependent: 106, dependent conditional: 39, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8482, independent: 8397, independent conditional: 143, independent unconditional: 8254, dependent: 85, dependent conditional: 18, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8482, independent: 8397, independent conditional: 143, independent unconditional: 8254, dependent: 85, dependent conditional: 18, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8482, independent: 8397, independent conditional: 0, independent unconditional: 8397, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8482, independent: 8397, independent conditional: 0, independent unconditional: 8397, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8482, independent: 8397, independent conditional: 0, independent unconditional: 8397, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7913, independent: 7846, independent conditional: 0, independent unconditional: 7846, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7913, independent: 7845, independent conditional: 0, independent unconditional: 7845, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 68, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 68, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 204, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 163, dependent conditional: 0, dependent unconditional: 163, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8482, independent: 551, independent conditional: 0, independent unconditional: 551, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 7913, unknown conditional: 0, unknown unconditional: 7913] , Statistics on independence cache: Total cache size (in pairs): 7913, Positive cache size: 7846, Positive conditional cache size: 0, Positive unconditional cache size: 7846, Negative cache size: 67, Negative conditional cache size: 0, Negative unconditional cache size: 67, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 21 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 46033, independent: 42015, independent conditional: 21373, independent unconditional: 20642, dependent: 4018, dependent conditional: 3932, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42184, independent: 42015, independent conditional: 21373, independent unconditional: 20642, dependent: 169, dependent conditional: 83, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 42184, independent: 42015, independent conditional: 21373, independent unconditional: 20642, dependent: 169, dependent conditional: 83, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42992, independent: 42015, independent conditional: 11, independent unconditional: 42004, dependent: 977, dependent conditional: 797, dependent unconditional: 180, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 42992, independent: 42015, independent conditional: 11, independent unconditional: 42004, dependent: 977, dependent conditional: 117, dependent unconditional: 860, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42992, independent: 42015, independent conditional: 11, independent unconditional: 42004, dependent: 977, dependent conditional: 117, dependent unconditional: 860, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15137, independent: 15028, independent conditional: 4, independent unconditional: 15024, dependent: 109, dependent conditional: 23, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15137, independent: 15019, independent conditional: 0, independent unconditional: 15019, dependent: 118, dependent conditional: 0, dependent unconditional: 118, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 118, independent: 9, independent conditional: 4, independent unconditional: 5, dependent: 109, dependent conditional: 23, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 118, independent: 9, independent conditional: 4, independent unconditional: 5, dependent: 109, dependent conditional: 23, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 338, independent: 77, independent conditional: 31, independent unconditional: 47, dependent: 260, dependent conditional: 84, dependent unconditional: 176, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 42992, independent: 26987, independent conditional: 7, independent unconditional: 26980, dependent: 868, dependent conditional: 94, dependent unconditional: 774, unknown: 15137, unknown conditional: 27, unknown unconditional: 15110] , Statistics on independence cache: Total cache size (in pairs): 15137, Positive cache size: 15028, Positive conditional cache size: 4, Positive unconditional cache size: 15024, Negative cache size: 109, Negative conditional cache size: 23, Negative unconditional cache size: 86, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 680, Maximal queried relation: 12, Independence queries for same thread: 3849 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.4s, Number of persistent set computation: 981, Number of trivial persistent sets: 686, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20728, independent: 20642, independent conditional: 0, independent unconditional: 20642, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 46033, independent: 42015, independent conditional: 21373, independent unconditional: 20642, dependent: 4018, dependent conditional: 3932, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42184, independent: 42015, independent conditional: 21373, independent unconditional: 20642, dependent: 169, dependent conditional: 83, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 42184, independent: 42015, independent conditional: 21373, independent unconditional: 20642, dependent: 169, dependent conditional: 83, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42992, independent: 42015, independent conditional: 11, independent unconditional: 42004, dependent: 977, dependent conditional: 797, dependent unconditional: 180, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 42992, independent: 42015, independent conditional: 11, independent unconditional: 42004, dependent: 977, dependent conditional: 117, dependent unconditional: 860, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42992, independent: 42015, independent conditional: 11, independent unconditional: 42004, dependent: 977, dependent conditional: 117, dependent unconditional: 860, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15137, independent: 15028, independent conditional: 4, independent unconditional: 15024, dependent: 109, dependent conditional: 23, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15137, independent: 15019, independent conditional: 0, independent unconditional: 15019, dependent: 118, dependent conditional: 0, dependent unconditional: 118, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 118, independent: 9, independent conditional: 4, independent unconditional: 5, dependent: 109, dependent conditional: 23, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 118, independent: 9, independent conditional: 4, independent unconditional: 5, dependent: 109, dependent conditional: 23, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 338, independent: 77, independent conditional: 31, independent unconditional: 47, dependent: 260, dependent conditional: 84, dependent unconditional: 176, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 42992, independent: 26987, independent conditional: 7, independent unconditional: 26980, dependent: 868, dependent conditional: 94, dependent unconditional: 774, unknown: 15137, unknown conditional: 27, unknown unconditional: 15110] , Statistics on independence cache: Total cache size (in pairs): 15137, Positive cache size: 15028, Positive conditional cache size: 4, Positive unconditional cache size: 15024, Negative cache size: 109, Negative conditional cache size: 23, Negative unconditional cache size: 86, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 680, Maximal queried relation: 12, Independence queries for same thread: 3849 - TimeoutResultAtElement [Line: 1064]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 446 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 1060]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 446 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 1061]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 446 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 1065]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 446 with TraceHistMax 8,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 334 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: reader_twoThread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 334 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 814.2s, OverallIterations: 15, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 29.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 265, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 4.2s SatisfiabilityAnalysisTime, 51.4s InterpolantComputationTime, 4217 NumberOfCodeBlocks, 4217 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 5580 ConstructedInterpolants, 334 QuantifiedInterpolants, 59547 SizeOfPredicates, 68 NumberOfNonLiveVariables, 3064 ConjunctsInSsa, 175 ConjunctsInUnsatCore, 22 InterpolantComputations, 10 PerfectInterpolantSequences, 3510/6418 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown