/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.dpor-d6e1636 [2023-01-10 12:39:24,272 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-10 12:39:24,273 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-10 12:39:24,310 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-10 12:39:24,310 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-10 12:39:24,313 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-10 12:39:24,316 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-10 12:39:24,317 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-10 12:39:24,319 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-10 12:39:24,323 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-10 12:39:24,325 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-10 12:39:24,326 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-10 12:39:24,326 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-10 12:39:24,329 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-10 12:39:24,330 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-10 12:39:24,331 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-10 12:39:24,331 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-10 12:39:24,332 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-10 12:39:24,335 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-10 12:39:24,339 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-10 12:39:24,340 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-10 12:39:24,341 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-10 12:39:24,341 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-10 12:39:24,342 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-10 12:39:24,349 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-10 12:39:24,350 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-10 12:39:24,350 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-10 12:39:24,351 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-10 12:39:24,352 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-10 12:39:24,352 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-10 12:39:24,352 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-10 12:39:24,353 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-10 12:39:24,354 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-10 12:39:24,355 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-10 12:39:24,355 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-10 12:39:24,355 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-10 12:39:24,356 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-10 12:39:24,356 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-10 12:39:24,356 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-10 12:39:24,357 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-10 12:39:24,358 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-10 12:39:24,359 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2023-01-10 12:39:24,384 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-10 12:39:24,384 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-10 12:39:24,385 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-01-10 12:39:24,385 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-01-10 12:39:24,386 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-10 12:39:24,386 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-10 12:39:24,386 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-10 12:39:24,387 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-10 12:39:24,387 INFO L138 SettingsManager]: * Use SBE=true [2023-01-10 12:39:24,387 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-10 12:39:24,388 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-10 12:39:24,388 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-10 12:39:24,388 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-10 12:39:24,388 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-10 12:39:24,388 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-10 12:39:24,388 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-10 12:39:24,388 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-10 12:39:24,389 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-10 12:39:24,389 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-10 12:39:24,389 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-10 12:39:24,389 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-10 12:39:24,389 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-10 12:39:24,389 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-10 12:39:24,389 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-10 12:39:24,390 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-10 12:39:24,390 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-10 12:39:24,390 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-10 12:39:24,390 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-10 12:39:24,390 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-10 12:39:24,391 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-10 12:39:24,391 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-10 12:39:24,391 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-01-10 12:39:24,391 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-01-10 12:39:24,391 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-01-10 12:39:24,391 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2023-01-10 12:39:24,392 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_ERROR_LOCATION [2023-01-10 12:39:24,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-10 12:39:24,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-10 12:39:24,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-10 12:39:24,599 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-10 12:39:24,600 INFO L275 PluginConnector]: CDTParser initialized [2023-01-10 12:39:24,601 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-01-10 12:39:25,704 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-10 12:39:25,982 INFO L351 CDTParser]: Found 1 translation units. [2023-01-10 12:39:25,982 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2023-01-10 12:39:25,996 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fcf287cc/b985992658914890b389614d5254df09/FLAG5574b8c23 [2023-01-10 12:39:26,008 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fcf287cc/b985992658914890b389614d5254df09 [2023-01-10 12:39:26,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-10 12:39:26,011 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-10 12:39:26,012 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-10 12:39:26,012 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-10 12:39:26,015 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-10 12:39:26,015 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:39:26" (1/1) ... [2023-01-10 12:39:26,016 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5abebc99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:26, skipping insertion in model container [2023-01-10 12:39:26,016 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:39:26" (1/1) ... [2023-01-10 12:39:26,022 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-10 12:39:26,065 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-10 12:39:26,172 WARN L631 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-01-10 12:39:26,423 WARN L247 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-01-10 12:39:26,428 WARN L247 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-01-10 12:39:26,429 WARN L247 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-01-10 12:39:26,495 WARN L247 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-01-10 12:39:26,496 WARN L247 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-01-10 12:39:26,498 WARN L247 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-01-10 12:39:26,499 WARN L247 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-01-10 12:39:26,508 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-10 12:39:26,518 INFO L203 MainTranslator]: Completed pre-run [2023-01-10 12:39:26,537 WARN L631 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-01-10 12:39:26,557 WARN L247 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-01-10 12:39:26,558 WARN L247 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-01-10 12:39:26,559 WARN L247 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-01-10 12:39:26,567 WARN L247 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-01-10 12:39:26,567 WARN L247 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-01-10 12:39:26,568 WARN L247 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-01-10 12:39:26,569 WARN L247 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-01-10 12:39:26,576 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-10 12:39:26,636 WARN L663 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-01-10 12:39:26,642 INFO L208 MainTranslator]: Completed translation [2023-01-10 12:39:26,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:26 WrapperNode [2023-01-10 12:39:26,643 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-10 12:39:26,644 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-10 12:39:26,644 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-10 12:39:26,644 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-10 12:39:26,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:26" (1/1) ... [2023-01-10 12:39:26,682 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:26" (1/1) ... [2023-01-10 12:39:26,710 INFO L138 Inliner]: procedures = 310, calls = 70, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 203 [2023-01-10 12:39:26,710 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-10 12:39:26,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-10 12:39:26,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-10 12:39:26,711 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-10 12:39:26,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:26" (1/1) ... [2023-01-10 12:39:26,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:26" (1/1) ... [2023-01-10 12:39:26,732 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:26" (1/1) ... [2023-01-10 12:39:26,733 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:26" (1/1) ... [2023-01-10 12:39:26,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:26" (1/1) ... [2023-01-10 12:39:26,743 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:26" (1/1) ... [2023-01-10 12:39:26,745 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:26" (1/1) ... [2023-01-10 12:39:26,747 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:26" (1/1) ... [2023-01-10 12:39:26,753 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-10 12:39:26,768 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-10 12:39:26,768 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-10 12:39:26,768 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-10 12:39:26,769 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:26" (1/1) ... [2023-01-10 12:39:26,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-10 12:39:26,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 12:39:26,793 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-01-10 12:39:26,795 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-01-10 12:39:26,827 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2023-01-10 12:39:26,827 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2023-01-10 12:39:26,827 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2023-01-10 12:39:26,827 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2023-01-10 12:39:26,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-10 12:39:26,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-10 12:39:26,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-10 12:39:26,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-10 12:39:26,828 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-01-10 12:39:26,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-10 12:39:26,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-10 12:39:26,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-10 12:39:26,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-10 12:39:26,829 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-10 12:39:26,980 INFO L236 CfgBuilder]: Building ICFG [2023-01-10 12:39:26,982 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-10 12:39:27,369 INFO L277 CfgBuilder]: Performing block encoding [2023-01-10 12:39:27,377 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-10 12:39:27,377 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-01-10 12:39:27,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:39:27 BoogieIcfgContainer [2023-01-10 12:39:27,380 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-10 12:39:27,382 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-10 12:39:27,382 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-10 12:39:27,385 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-10 12:39:27,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:39:26" (1/3) ... [2023-01-10 12:39:27,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d57f86d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:39:27, skipping insertion in model container [2023-01-10 12:39:27,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:39:26" (2/3) ... [2023-01-10 12:39:27,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d57f86d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:39:27, skipping insertion in model container [2023-01-10 12:39:27,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:39:27" (3/3) ... [2023-01-10 12:39:27,387 INFO L112 eAbstractionObserver]: Analyzing ICFG ring_2w1r-1.i [2023-01-10 12:39:27,394 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-01-10 12:39:27,402 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-10 12:39:27,403 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-01-10 12:39:27,403 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-10 12:39:27,524 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-01-10 12:39:27,572 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 12:39:27,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-01-10 12:39:27,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 12:39:27,576 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-01-10 12:39:27,578 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-01-10 12:39:27,620 INFO L164 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-01-10 12:39:27,626 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2023-01-10 12:39:27,632 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;@54ae5ede, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 12:39:27,632 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-10 12:39:27,635 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2023-01-10 12:39:27,638 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-01-10 12:39:27,643 INFO L445 BasicCegarLoop]: Path program histogram: [] [2023-01-10 12:39:27,644 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION was SAFE (1/10) [2023-01-10 12:39:27,651 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 12:39:27,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-01-10 12:39:27,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 12:39:27,654 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-01-10 12:39:27,656 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-01-10 12:39:27,661 INFO L164 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-01-10 12:39:27,662 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION ======== [2023-01-10 12:39:27,663 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;@54ae5ede, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 12:39:27,663 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-10 12:39:27,663 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2023-01-10 12:39:27,663 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-01-10 12:39:27,665 INFO L445 BasicCegarLoop]: Path program histogram: [] [2023-01-10 12:39:27,665 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION was SAFE (2/10) [2023-01-10 12:39:27,672 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 12:39:27,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-01-10 12:39:27,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 12:39:27,685 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-01-10 12:39:27,700 INFO L164 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-01-10 12:39:27,700 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION ======== [2023-01-10 12:39:27,701 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;@54ae5ede, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 12:39:27,701 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-10 12:39:27,701 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2023-01-10 12:39:27,701 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-01-10 12:39:27,703 INFO L445 BasicCegarLoop]: Path program histogram: [] [2023-01-10 12:39:27,703 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION was SAFE (3/10) [2023-01-10 12:39:27,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2023-01-10 12:39:27,711 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 12:39:27,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-01-10 12:39:27,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 12:39:27,716 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-01-10 12:39:27,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2023-01-10 12:39:27,724 INFO L164 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-01-10 12:39:27,724 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION ======== [2023-01-10 12:39:27,725 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;@54ae5ede, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 12:39:27,725 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-10 12:39:27,725 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2023-01-10 12:39:27,725 INFO L805 garLoopResultBuilder]: Registering result SAFE for location reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-01-10 12:39:27,727 INFO L445 BasicCegarLoop]: Path program histogram: [] [2023-01-10 12:39:27,727 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION was SAFE (4/10) [2023-01-10 12:39:27,740 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 12:39:27,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-01-10 12:39:27,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 12:39:27,747 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-01-10 12:39:27,751 INFO L164 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-01-10 12:39:27,752 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2023-01-10 12:39:27,753 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;@54ae5ede, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 12:39:27,753 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-10 12:39:27,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2023-01-10 12:39:28,010 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-01-10 12:39:28,011 INFO L445 BasicCegarLoop]: Path program histogram: [] [2023-01-10 12:39:28,011 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (5/10) [2023-01-10 12:39:28,015 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 12:39:28,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-01-10 12:39:28,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 12:39:28,025 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-01-10 12:39:28,035 INFO L164 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-01-10 12:39:28,035 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2023-01-10 12:39:28,035 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;@54ae5ede, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 12:39:28,036 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-10 12:39:28,038 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-01-10 12:39:28,039 INFO L445 BasicCegarLoop]: Path program histogram: [] [2023-01-10 12:39:28,040 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (6/10) [2023-01-10 12:39:28,044 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 12:39:28,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-01-10 12:39:28,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 12:39:28,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2023-01-10 12:39:28,047 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-01-10 12:39:28,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2023-01-10 12:39:28,051 INFO L164 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-01-10 12:39:28,052 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2023-01-10 12:39:28,052 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;@54ae5ede, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 12:39:28,052 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-10 12:39:28,312 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 12:39:28,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 12:39:28,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1781473882, now seen corresponding path program 1 times [2023-01-10 12:39:28,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 12:39:28,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40618422] [2023-01-10 12:39:28,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 12:39:28,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 12:39:28,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 12:39:29,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 12:39:29,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 12:39:29,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40618422] [2023-01-10 12:39:29,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40618422] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-10 12:39:29,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-10 12:39:29,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-01-10 12:39:29,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360062486] [2023-01-10 12:39:29,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-10 12:39:29,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-01-10 12:39:29,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 12:39:29,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-01-10 12:39:29,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2023-01-10 12:39:29,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:39:29,889 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 12:39:29,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.5) internal successors, (81), 18 states have internal predecessors, (81), 0 states have call successors, (0), 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-01-10 12:39:29,890 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:39:33,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 12:39:33,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-10 12:39:33,011 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 12:39:33,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 12:39:33,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1493353800, now seen corresponding path program 1 times [2023-01-10 12:39:33,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 12:39:33,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433664672] [2023-01-10 12:39:33,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 12:39:33,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 12:39:33,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 12:39:36,233 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 12:39:36,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 12:39:36,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433664672] [2023-01-10 12:39:36,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433664672] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 12:39:36,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745391807] [2023-01-10 12:39:36,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 12:39:36,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 12:39:36,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 12:39:36,245 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 12:39:36,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-01-10 12:39:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 12:39:36,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 90 conjunts are in the unsatisfiable core [2023-01-10 12:39:36,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 12:39:36,503 INFO L350 Elim1Store]: Elim1 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-01-10 12:39:36,521 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-01-10 12:39:36,521 INFO L350 Elim1Store]: Elim1 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-01-10 12:39:36,556 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-01-10 12:39:36,557 INFO L350 Elim1Store]: Elim1 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-01-10 12:39:36,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-01-10 12:39:36,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:39:36,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-01-10 12:39:36,687 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 23 [2023-01-10 12:39:37,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2023-01-10 12:39:37,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:39:37,681 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 12:39:37,699 INFO L321 Elim1Store]: treesize reduction 63, result has 22.2 percent of original size [2023-01-10 12:39:37,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 39 [2023-01-10 12:39:38,014 INFO L321 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2023-01-10 12:39:38,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 30 [2023-01-10 12:39:38,200 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 12:39:38,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 12:39:39,885 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_69 Int) (v_ArrVal_68 (Array Int Int))) (or (< v_ArrVal_69 1) (< 0 (let ((.cse0 (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_68))) (store .cse1 |c_ULTIMATE.start_main_~#r~3#1.base| (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* 4 (select .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) 4) v_ArrVal_69)))) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse0 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* (select .cse0 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4))))))) is different from false [2023-01-10 12:39:40,241 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_69 Int) (v_ArrVal_68 (Array Int Int))) (or (< 0 (let ((.cse0 (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_68))) (store .cse1 |c_ULTIMATE.start_main_~#r~3#1.base| (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* 4 (select .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) 4) v_ArrVal_69)))) |c_reader_twoThread1of1ForFork0_#in~arg#1.base|))) (select .cse0 (+ |c_reader_twoThread1of1ForFork0_#in~arg#1.offset| (* (select .cse0 |c_reader_twoThread1of1ForFork0_#in~arg#1.offset|) 4) 4)))) (< v_ArrVal_69 1))) is different from false [2023-01-10 12:39:40,256 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_69 Int) (v_ArrVal_68 (Array Int Int))) (or (< 0 (let ((.cse0 (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* 4 (select .cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) 4) v_ArrVal_69)))) (select .cse0 (+ (* (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4)))) (< v_ArrVal_69 1))) is different from false [2023-01-10 12:39:40,272 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_67 (Array Int Int)) (v_ArrVal_69 Int) (v_ArrVal_68 (Array Int Int))) (or (< 0 (let ((.cse0 (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#reader~0#1.base| v_ArrVal_67) |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20)) 4) 4) v_ArrVal_69)))) (select .cse0 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) 4)))) (< v_ArrVal_69 1))) is different from false [2023-01-10 12:39:40,325 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_67 (Array Int Int)) (v_ArrVal_69 Int) (v_ArrVal_68 (Array Int Int))) (or (< v_ArrVal_69 1) (< 0 (let ((.cse0 (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_ring_init_~r#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ring_init_~r#1.base|) |c_ULTIMATE.start_ring_init_~r#1.offset| 0)) |c_ULTIMATE.start_main_~#reader~0#1.base| v_ArrVal_67) |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20)) 4) 4) v_ArrVal_69)))) (select .cse0 (+ (* 4 (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.offset|)) |c_ULTIMATE.start_main_~#r~3#1.offset| 4)))))) is different from false [2023-01-10 12:39:40,338 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 12:39:40,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 120 treesize of output 87 [2023-01-10 12:39:40,349 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 12:39:40,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 392 treesize of output 380 [2023-01-10 12:39:40,374 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 12:39:40,397 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 12:39:40,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 206 treesize of output 197 [2023-01-10 12:39:40,427 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 12:39:40,447 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 12:39:40,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 324 treesize of output 255 [2023-01-10 12:39:40,529 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 12:39:40,529 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 9 [2023-01-10 12:39:40,967 INFO L321 Elim1Store]: treesize reduction 12, result has 91.1 percent of original size [2023-01-10 12:39:40,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 184 treesize of output 249 [2023-01-10 12:39:44,947 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-01-10 12:39:44,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745391807] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 12:39:44,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 12:39:44,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 31] total 73 [2023-01-10 12:39:44,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598091196] [2023-01-10 12:39:44,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 12:39:44,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2023-01-10 12:39:44,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 12:39:44,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2023-01-10 12:39:44,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=4322, Unknown=30, NotChecked=680, Total=5256 [2023-01-10 12:39:44,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:39:44,954 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 12:39:44,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 3.684931506849315) internal successors, (269), 73 states have internal predecessors, (269), 0 states have call successors, (0), 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-01-10 12:39:44,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 12:39:44,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:40:25,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-10 12:40:25,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2023-01-10 12:40:25,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-01-10 12:40:25,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-01-10 12:40:25,741 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 12:40:25,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 12:40:25,741 INFO L85 PathProgramCache]: Analyzing trace with hash -944544352, now seen corresponding path program 1 times [2023-01-10 12:40:25,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 12:40:25,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315100165] [2023-01-10 12:40:25,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 12:40:25,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 12:40:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 12:40:29,884 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 12:40:29,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 12:40:29,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315100165] [2023-01-10 12:40:29,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315100165] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 12:40:29,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75500405] [2023-01-10 12:40:29,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 12:40:29,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 12:40:29,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 12:40:29,888 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 12:40:29,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-01-10 12:40:29,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 12:40:30,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 145 conjunts are in the unsatisfiable core [2023-01-10 12:40:30,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 12:40:30,024 INFO L350 Elim1Store]: Elim1 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-01-10 12:40:30,041 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-01-10 12:40:30,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-01-10 12:40:30,101 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-01-10 12:40:30,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-01-10 12:40:30,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-10 12:40:30,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-01-10 12:40:30,860 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-01-10 12:40:31,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:40:32,003 INFO L321 Elim1Store]: treesize reduction 32, result has 41.8 percent of original size [2023-01-10 12:40:32,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 49 [2023-01-10 12:40:32,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:40:32,368 INFO L321 Elim1Store]: treesize reduction 22, result has 52.2 percent of original size [2023-01-10 12:40:32,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 163 treesize of output 120 [2023-01-10 12:40:34,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 12:40:34,479 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 12:40:34,494 INFO L321 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2023-01-10 12:40:34,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 38 [2023-01-10 12:40:34,934 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 12:40:34,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 12:43:20,984 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork0_~arg#1.base|) |c_reader_twoThread1of1ForFork0_~arg#1.offset|)) (.cse3 (+ 20 |c_reader_twoThread1of1ForFork0_~arg#1.offset|)) (.cse11 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (and (forall ((v_ArrVal_138 Int)) (or (forall ((v_ArrVal_142 Int)) (or (< v_ArrVal_142 2) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse7 (select .cse1 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse8 (select .cse7 .cse11))) (let ((.cse10 (store .cse7 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse8 4) 4) v_ArrVal_138))) (let ((.cse9 (mod (+ (select .cse10 .cse11) 1) 4))) (let ((.cse2 (store .cse10 .cse11 .cse9))) (let ((.cse6 (select (store .cse1 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse2 (+ (* .cse9 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~arg#1.base|))) (let ((.cse0 (mod (+ .cse8 1) 4)) (.cse5 (select .cse6 |c_reader_twoThread1of1ForFork0_~arg#1.offset|))) (or (not (= .cse0 0)) (not (= (select (select (store .cse1 |c_ULTIMATE.start_main_~#r~3#1.base| .cse2) |c_reader_twoThread1of1ForFork0_~arg#1.base|) .cse3) .cse4)) (= .cse5 (select .cse6 .cse3)) (= .cse0 (select .cse7 |c_ULTIMATE.start_main_~#r~3#1.offset|)) (< 0 (select .cse6 (+ (* .cse5 4) 4 |c_reader_twoThread1of1ForFork0_~arg#1.offset|))))))))))))))) (< v_ArrVal_138 1))) (forall ((v_ArrVal_138 Int)) (or (forall ((v_ArrVal_142 Int)) (or (< v_ArrVal_142 2) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse14 (select .cse18 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse13 (select .cse14 .cse11))) (let ((.cse20 (store .cse14 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse13 4) 4) v_ArrVal_138))) (let ((.cse12 (+ (select .cse20 .cse11) 1))) (let ((.cse17 (mod .cse12 4))) (let ((.cse19 (store .cse20 .cse11 (+ (- 4) .cse17)))) (let ((.cse15 (select (store .cse18 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse19 (+ (* .cse17 4) |c_ULTIMATE.start_main_~#r~3#1.offset| (- 12)) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~arg#1.base|))) (let ((.cse16 (select .cse15 |c_reader_twoThread1of1ForFork0_~arg#1.offset|))) (or (<= 0 .cse12) (= (mod (+ .cse13 1) 4) (+ (select .cse14 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4)) (= (select .cse15 .cse3) .cse16) (= .cse17 0) (< 0 (select .cse15 (+ (* 4 .cse16) 4 |c_reader_twoThread1of1ForFork0_~arg#1.offset|))) (not (= .cse4 (select (select (store .cse18 |c_ULTIMATE.start_main_~#r~3#1.base| .cse19) |c_reader_twoThread1of1ForFork0_~arg#1.base|) .cse3)))))))))))))))) (< v_ArrVal_138 1))) (forall ((v_ArrVal_138 Int)) (or (< v_ArrVal_138 1) (forall ((v_ArrVal_142 Int)) (or (< v_ArrVal_142 2) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse27 (select .cse22 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse26 (select .cse27 .cse11))) (let ((.cse29 (store .cse27 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse26 4) 4) v_ArrVal_138))) (let ((.cse21 (+ (select .cse29 .cse11) 1))) (let ((.cse28 (mod .cse21 4))) (let ((.cse23 (store .cse29 .cse11 .cse28))) (let ((.cse25 (select (store .cse22 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse23 (+ (* .cse28 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~arg#1.base|))) (let ((.cse24 (select .cse25 |c_reader_twoThread1of1ForFork0_~arg#1.offset|))) (or (< .cse21 0) (not (= (select (select (store .cse22 |c_ULTIMATE.start_main_~#r~3#1.base| .cse23) |c_reader_twoThread1of1ForFork0_~arg#1.base|) .cse3) .cse4)) (= .cse24 (select .cse25 .cse3)) (= (mod (+ .cse26 1) 4) (select .cse27 |c_ULTIMATE.start_main_~#r~3#1.offset|)) (< 0 (select .cse25 (+ (* .cse24 4) 4 |c_reader_twoThread1of1ForFork0_~arg#1.offset|)))))))))))))))))))) is different from false [2023-01-10 12:43:21,240 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork0_#in~arg#1.base|) |c_reader_twoThread1of1ForFork0_#in~arg#1.offset|)) (.cse1 (+ |c_reader_twoThread1of1ForFork0_#in~arg#1.offset| 20)) (.cse11 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (and (forall ((v_ArrVal_138 Int)) (or (forall ((v_ArrVal_142 Int)) (or (< v_ArrVal_142 2) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse8 (select .cse4 .cse11))) (let ((.cse10 (store .cse4 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse8 4) 4) v_ArrVal_138))) (let ((.cse9 (mod (+ (select .cse10 .cse11) 1) 4))) (let ((.cse7 (store .cse10 .cse11 .cse9))) (let ((.cse0 (select (store .cse6 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse7 (+ (* .cse9 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_#in~arg#1.base|))) (let ((.cse2 (select .cse0 |c_reader_twoThread1of1ForFork0_#in~arg#1.offset|)) (.cse3 (mod (+ .cse8 1) 4))) (or (= (select .cse0 .cse1) .cse2) (not (= .cse3 0)) (< 0 (select .cse0 (+ (* .cse2 4) |c_reader_twoThread1of1ForFork0_#in~arg#1.offset| 4))) (= .cse3 (select .cse4 |c_ULTIMATE.start_main_~#r~3#1.offset|)) (not (= .cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#r~3#1.base| .cse7) |c_reader_twoThread1of1ForFork0_#in~arg#1.base|) .cse1))))))))))))))) (< v_ArrVal_138 1))) (forall ((v_ArrVal_138 Int)) (or (forall ((v_ArrVal_142 Int)) (or (< v_ArrVal_142 2) (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse16 (select .cse17 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse15 (select .cse16 .cse11))) (let ((.cse20 (store .cse16 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse15 4) 4) v_ArrVal_138))) (let ((.cse14 (+ (select .cse20 .cse11) 1))) (let ((.cse19 (mod .cse14 4))) (let ((.cse18 (store .cse20 .cse11 .cse19))) (let ((.cse12 (select (store .cse17 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse18 (+ (* .cse19 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_#in~arg#1.base|))) (let ((.cse13 (select .cse12 |c_reader_twoThread1of1ForFork0_#in~arg#1.offset|))) (or (= (select .cse12 .cse1) .cse13) (< .cse14 0) (< 0 (select .cse12 (+ (* .cse13 4) |c_reader_twoThread1of1ForFork0_#in~arg#1.offset| 4))) (= (mod (+ .cse15 1) 4) (select .cse16 |c_ULTIMATE.start_main_~#r~3#1.offset|)) (not (= .cse5 (select (select (store .cse17 |c_ULTIMATE.start_main_~#r~3#1.base| .cse18) |c_reader_twoThread1of1ForFork0_#in~arg#1.base|) .cse1)))))))))))))))) (< v_ArrVal_138 1))) (forall ((v_ArrVal_138 Int)) (or (forall ((v_ArrVal_142 Int)) (or (forall ((v_ArrVal_136 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_136))) (let ((.cse27 (select .cse24 |c_ULTIMATE.start_main_~#r~3#1.base|))) (let ((.cse26 (select .cse27 .cse11))) (let ((.cse29 (store .cse27 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* .cse26 4) 4) v_ArrVal_138))) (let ((.cse21 (+ (select .cse29 .cse11) 1))) (let ((.cse28 (mod .cse21 4))) (let ((.cse25 (store .cse29 .cse11 (+ (- 4) .cse28)))) (let ((.cse22 (select (store .cse24 |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse25 (+ (* .cse28 4) |c_ULTIMATE.start_main_~#r~3#1.offset| (- 12)) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_#in~arg#1.base|))) (let ((.cse23 (select .cse22 |c_reader_twoThread1of1ForFork0_#in~arg#1.offset|))) (or (<= 0 .cse21) (< 0 (select .cse22 (+ |c_reader_twoThread1of1ForFork0_#in~arg#1.offset| 4 (* .cse23 4)))) (not (= .cse5 (select (select (store .cse24 |c_ULTIMATE.start_main_~#r~3#1.base| .cse25) |c_reader_twoThread1of1ForFork0_#in~arg#1.base|) .cse1))) (= (mod (+ .cse26 1) 4) (+ (select .cse27 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4)) (= .cse28 0) (= (select .cse22 .cse1) .cse23)))))))))))) (< v_ArrVal_142 2))) (< v_ArrVal_138 1))))) is different from false [2023-01-10 12:43:25,842 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 12:43:25,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 567 treesize of output 407 [2023-01-10 12:43:25,880 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 12:43:25,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2627 treesize of output 2529 [2023-01-10 12:43:25,921 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 12:43:25,922 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 12:43:26,085 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 12:43:26,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 17366 treesize of output 12845 [2023-01-10 12:43:26,637 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 12:43:26,638 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 12:43:26,824 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 12:43:26,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 72075 treesize of output 52076 [2023-01-10 12:43:27,894 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 4 [2023-01-10 12:43:29,227 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 12:43:29,227 INFO L350 Elim1Store]: Elim1 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 28 treesize of output 32 [2023-01-10 12:43:35,493 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-01-10 12:43:35,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 479 treesize of output 335 [2023-01-10 12:43:35,507 INFO L350 Elim1Store]: Elim1 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 2203 treesize of output 2111 [2023-01-10 12:43:35,548 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 12:43:35,673 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 12:43:35,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 28911 treesize of output 20245 [2023-01-10 12:43:36,004 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 12:43:36,057 INFO L321 Elim1Store]: treesize reduction 32, result has 23.8 percent of original size [2023-01-10 12:43:36,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 8170 treesize of output 5935 [2023-01-10 12:43:36,170 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 12:43:36,232 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 12:43:36,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 2123 treesize of output 1731 [2023-01-10 12:43:37,360 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-01-10 12:43:37,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 504 treesize of output 1 [2023-01-10 12:43:40,414 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 12:43:40,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75500405] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 12:43:40,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 12:43:40,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 46, 52] total 134 [2023-01-10 12:43:40,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106107625] [2023-01-10 12:43:40,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 12:43:40,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 134 states [2023-01-10 12:43:40,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 12:43:40,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2023-01-10 12:43:40,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=914, Invalid=16230, Unknown=156, NotChecked=522, Total=17822 [2023-01-10 12:43:40,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:43:40,422 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 12:43:40,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 134 states, 134 states have (on average 2.716417910447761) internal successors, (364), 134 states have internal predecessors, (364), 0 states have call successors, (0), 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-01-10 12:43:40,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-01-10 12:43:40,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 103 states. [2023-01-10 12:43:40,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 12:44:31,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:44:40,164 WARN L222 SmtUtils]: Spent 7.50s on a formula simplification. DAG size of input: 309 DAG size of output: 282 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 12:45:02,816 WARN L222 SmtUtils]: Spent 20.55s on a formula simplification. DAG size of input: 322 DAG size of output: 295 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 12:45:07,750 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse43 (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (.cse16 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20))) (let ((.cse129 (select .cse43 .cse16))) (let ((.cse126 (+ .cse129 1))) (let ((.cse127 (mod .cse126 4))) (let ((.cse125 (= .cse127 0)) (.cse128 (select .cse43 |c_ULTIMATE.start_writer_fn_~r~1#1.offset|))) (let ((.cse2 (select |c_#memory_int| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|)) (.cse0 (select |c_#memory_int| |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base|)) (.cse3 (select |c_#memory_int| |c_reader_twoThread1of1ForFork0_#in~arg#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base|)) (.cse11 (+ |c_ULTIMATE.start_writer_fn_~i~1#1| 2)) (.cse35 (select |c_#memory_int| |c_reader_twoThread1of1ForFork0_~arg#1.base|)) (.cse36 (and (not .cse125) (< .cse126 0) (= .cse127 (+ .cse128 4)))) (.cse44 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* .cse129 4) 4)) (.cse57 (and (or .cse125 (<= 0 .cse126)) (= .cse127 .cse128))) (.cse10 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 20)) (.cse13 (+ 20 |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.offset|))) (and (= |c_ULTIMATE.start_main_~#r~3#1.offset| |c_reader_twoThread1of1ForFork0_#in~arg#1.offset|) (= (select .cse0 20) 0) (= (select .cse1 |c_ULTIMATE.start_main_~#r~3#1.offset|) 0) (= |c_ULTIMATE.start_main_~#r~3#1.offset| |c_reader_twoThread1of1ForFork0_~arg#1.offset|) (= |c_ULTIMATE.start_main_~#r~3#1.offset| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.offset|) (= |c_ULTIMATE.start_main_~#r~3#1.offset| |c_ULTIMATE.start_ring_init_#in~r#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 1) (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_ULTIMATE.start_ring_init_#in~r#1.base|) (= |c_ULTIMATE.start_main_~#r~3#1.offset| |c_ULTIMATE.start_ring_init_~r#1.offset|) (= (select .cse2 20) 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_ring_init_~r#1.base|) (+ 20 |c_ULTIMATE.start_ring_init_~r#1.offset|)) 0) (= (select .cse2 |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.offset|) 0) (= (select .cse3 20) 0) (not (= |c_ULTIMATE.start_main_~#reader~0#1.base| |c_ULTIMATE.start_ring_init_~r#1.base|)) (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_ULTIMATE.start_ring_init_~r#1.base|) (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_reader_twoThread1of1ForFork0_~arg#1.base|) (= (select .cse0 |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset|) 0) (let ((.cse19 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base|)) (.cse18 (+ 20 |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|))) (let ((.cse34 (select .cse19 .cse18))) (let ((.cse5 (+ 1 .cse34))) (let ((.cse6 (mod .cse5 4))) (let ((.cse4 (= .cse6 0)) (.cse7 (select .cse19 |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|))) (or (and (not .cse4) (< .cse5 0) (= .cse6 (+ 4 .cse7))) (and (or .cse4 (<= 0 .cse5)) (= .cse6 .cse7)) (let ((.cse20 (+ (* 4 .cse34) 4 |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|))) (and (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse17 (store .cse19 .cse20 v_ArrVal_138))) (let ((.cse14 (mod (+ (select .cse17 .cse18) 1) 4))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| (store .cse17 .cse18 .cse14)))) (let ((.cse8 (select (store .cse12 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (let ((.cse15 (select .cse12 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (store .cse15 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select .cse15 .cse16) 4) 4) v_ArrVal_142))) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse9 (select .cse8 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< v_ArrVal_138 |c_ULTIMATE.start_ring_enqueue_#in~x#1|) (< 0 (select .cse8 (+ (* .cse9 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))) (= .cse9 (select .cse8 .cse10)) (< v_ArrVal_142 .cse11) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select .cse12 |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse13))) (not (= .cse14 0))))))))) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse27 (store .cse19 .cse20 v_ArrVal_138))) (let ((.cse21 (+ (select .cse27 .cse18) 1))) (let ((.cse22 (mod .cse21 4))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| (store .cse27 .cse18 (+ (- 4) .cse22))))) (let ((.cse24 (select (store .cse23 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (let ((.cse26 (select .cse23 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (store .cse26 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 4 (* (select .cse26 .cse16) 4)) v_ArrVal_142))) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse25 (select .cse24 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< v_ArrVal_138 |c_ULTIMATE.start_ring_enqueue_#in~x#1|) (<= 0 .cse21) (= .cse22 0) (not (= (select (select .cse23 |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse13) |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1|)) (< 0 (select .cse24 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse25 4) 4))) (< v_ArrVal_142 .cse11) (= .cse25 (select .cse24 .cse10)))))))))) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse33 (store .cse19 .cse20 v_ArrVal_138))) (let ((.cse30 (+ (select .cse33 .cse18) 1))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| (store .cse33 .cse18 (mod .cse30 4))))) (let ((.cse28 (select (store .cse31 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (let ((.cse32 (select .cse31 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (store .cse32 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select .cse32 .cse16) 4) 4) v_ArrVal_142))) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse29 (select .cse28 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< v_ArrVal_138 |c_ULTIMATE.start_ring_enqueue_#in~x#1|) (< 0 (select .cse28 (+ (* .cse29 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))) (< .cse30 0) (= .cse29 (select .cse28 .cse10)) (< v_ArrVal_142 .cse11) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select .cse31 |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse13)))))))))))))))))) (= (select .cse3 |c_reader_twoThread1of1ForFork0_#in~arg#1.offset|) 0) (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_reader_twoThread1of1ForFork0_#in~arg#1.base|) (not (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_ULTIMATE.start_main_~#reader~0#1.base|)) (= (select .cse35 |c_reader_twoThread1of1ForFork0_~arg#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#writer~0#1.base| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|)) (= (select .cse1 20) 0) (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_reader_twoThread1of1ForFork0_~r~2#1.base|) (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) (= |c_ULTIMATE.start_main_~#r~3#1.offset| 0) (= |c_ULTIMATE.start_main_~#r~3#1.offset| |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#reader~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#writer~0#1.base| |c_ULTIMATE.start_main_~#reader~0#1.base|)) (or .cse36 (let ((.cse40 (+ |c_ULTIMATE.start_writer_fn_~i~1#1| 1))) (and (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse42 (store .cse43 .cse44 v_ArrVal_138))) (let ((.cse37 (mod (+ (select .cse42 .cse16) 1) 4))) (let ((.cse41 (store .cse42 .cse16 .cse37))) (let ((.cse38 (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse41 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* .cse37 4) 4) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse39 (select .cse38 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (not (= .cse37 0)) (< 0 (select .cse38 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse39 4) 4))) (< v_ArrVal_142 .cse11) (< v_ArrVal_138 .cse40) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| .cse41) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse13))) (= (select .cse38 .cse10) .cse39)))))))) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse50 (store .cse43 .cse44 v_ArrVal_138))) (let ((.cse45 (+ (select .cse50 .cse16) 1))) (let ((.cse49 (mod .cse45 4))) (let ((.cse48 (store .cse50 .cse16 .cse49))) (let ((.cse46 (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse48 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* .cse49 4) 4) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse47 (select .cse46 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< .cse45 0) (< 0 (select .cse46 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse47 4) 4))) (< v_ArrVal_142 .cse11) (< v_ArrVal_138 .cse40) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| .cse48) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse13))) (= (select .cse46 .cse10) .cse47))))))))) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse56 (store .cse43 .cse44 v_ArrVal_138))) (let ((.cse55 (+ (select .cse56 .cse16) 1))) (let ((.cse54 (mod .cse55 4))) (let ((.cse51 (store .cse56 .cse16 (+ .cse54 (- 4))))) (let ((.cse52 (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse51 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* .cse54 4) (- 12)) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse53 (select .cse52 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| .cse51) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse13) |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1|)) (< 0 (select .cse52 (+ (* .cse53 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))) (= .cse54 0) (<= 0 .cse55) (< v_ArrVal_142 .cse11) (= .cse53 (select .cse52 .cse10)) (< v_ArrVal_138 .cse40))))))))))) .cse57) (= |c_ULTIMATE.start_main_~#r~3#1.offset| |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset|) (not (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_ULTIMATE.start_main_~#writer~0#1.base|)) (= (select .cse35 20) 0) (or .cse36 (and (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse62 (store .cse43 .cse44 v_ArrVal_138))) (let ((.cse58 (mod (+ (select .cse62 .cse16) 1) 4))) (let ((.cse61 (store .cse62 .cse16 .cse58))) (let ((.cse59 (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse61 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* .cse58 4) 4) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse60 (select .cse59 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (not (= .cse58 0)) (< v_ArrVal_142 2) (< 0 (select .cse59 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse60 4) 4))) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| .cse61) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse13))) (< v_ArrVal_138 1) (= (select .cse59 .cse10) .cse60)))))))) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse68 (store .cse43 .cse44 v_ArrVal_138))) (let ((.cse67 (+ (select .cse68 .cse16) 1))) (let ((.cse66 (mod .cse67 4))) (let ((.cse63 (store .cse68 .cse16 (+ .cse66 (- 4))))) (let ((.cse64 (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse63 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* .cse66 4) (- 12)) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse65 (select .cse64 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| .cse63) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse13) |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1|)) (< 0 (select .cse64 (+ (* .cse65 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))) (= .cse66 0) (< v_ArrVal_142 2) (<= 0 .cse67) (= .cse65 (select .cse64 .cse10)) (< v_ArrVal_138 1))))))))) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse74 (store .cse43 .cse44 v_ArrVal_138))) (let ((.cse69 (+ (select .cse74 .cse16) 1))) (let ((.cse73 (mod .cse69 4))) (let ((.cse72 (store .cse74 .cse16 .cse73))) (let ((.cse70 (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store .cse72 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* .cse73 4) 4) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse71 (select .cse70 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< .cse69 0) (< v_ArrVal_142 2) (< 0 (select .cse70 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse71 4) 4))) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| .cse72) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse13))) (< v_ArrVal_138 1) (= (select .cse70 .cse10) .cse71)))))))))) .cse57) (= |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| |c_ULTIMATE.start_main_~#r~3#1.base|) (let ((.cse86 (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_~arg#1.base|)) (.cse85 (+ |c_ULTIMATE.start_writer_fn_~arg#1.offset| 20))) (let ((.cse99 (select .cse86 .cse85))) (let ((.cse76 (+ .cse99 1))) (let ((.cse78 (mod .cse76 4))) (let ((.cse77 (select .cse86 |c_ULTIMATE.start_writer_fn_~arg#1.offset|)) (.cse75 (= .cse78 0))) (or (and (or .cse75 (<= 0 .cse76)) (= .cse77 .cse78)) (and (= .cse78 (+ .cse77 4)) (not .cse75) (< .cse76 0)) (let ((.cse87 (+ |c_ULTIMATE.start_writer_fn_~arg#1.offset| (* .cse99 4) 4))) (and (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse84 (store .cse86 .cse87 v_ArrVal_138))) (let ((.cse81 (+ (select .cse84 .cse85) 1))) (let ((.cse83 (mod .cse81 4))) (let ((.cse82 (store .cse84 .cse85 .cse83))) (let ((.cse79 (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~arg#1.base| (store .cse82 (+ |c_ULTIMATE.start_writer_fn_~arg#1.offset| (* 4 .cse83) 4) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse80 (select .cse79 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< v_ArrVal_142 2) (< 0 (select .cse79 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* .cse80 4)))) (< .cse81 0) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~arg#1.base| .cse82) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse13))) (< v_ArrVal_138 1) (= (select .cse79 .cse10) .cse80))))))))) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse92 (store .cse86 .cse87 v_ArrVal_138))) (let ((.cse88 (mod (+ (select .cse92 .cse85) 1) 4))) (let ((.cse91 (store .cse92 .cse85 .cse88))) (let ((.cse89 (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~arg#1.base| (store .cse91 (+ |c_ULTIMATE.start_writer_fn_~arg#1.offset| (* 4 .cse88) 4) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse90 (select .cse89 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (not (= 0 .cse88)) (< v_ArrVal_142 2) (< 0 (select .cse89 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* .cse90 4)))) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~arg#1.base| .cse91) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse13))) (< v_ArrVal_138 1) (= (select .cse89 .cse10) .cse90)))))))) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse98 (store .cse86 .cse87 v_ArrVal_138))) (let ((.cse94 (+ (select .cse98 .cse85) 1))) (let ((.cse93 (mod .cse94 4))) (let ((.cse97 (store .cse98 .cse85 (+ (- 4) .cse93)))) (let ((.cse95 (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~arg#1.base| (store .cse97 (+ |c_ULTIMATE.start_writer_fn_~arg#1.offset| (* 4 .cse93) (- 12)) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse96 (select .cse95 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (= 0 .cse93) (<= 0 .cse94) (< v_ArrVal_142 2) (< 0 (select .cse95 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4 (* .cse96 4)))) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~arg#1.base| .cse97) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse13))) (< v_ArrVal_138 1) (= (select .cse95 .cse10) .cse96))))))))))))))))) (let ((.cse107 (select |c_#memory_int| |c_ULTIMATE.start_writer_fn_#in~arg#1.base|)) (.cse106 (+ |c_ULTIMATE.start_writer_fn_#in~arg#1.offset| 20))) (let ((.cse120 (select .cse107 .cse106))) (let ((.cse121 (+ .cse120 1))) (let ((.cse124 (mod .cse121 4))) (let ((.cse123 (select .cse107 |c_ULTIMATE.start_writer_fn_#in~arg#1.offset|)) (.cse122 (= .cse124 0))) (or (let ((.cse108 (+ |c_ULTIMATE.start_writer_fn_#in~arg#1.offset| 4 (* 4 .cse120)))) (and (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse105 (store .cse107 .cse108 v_ArrVal_138))) (let ((.cse103 (+ (select .cse105 .cse106) 1))) (let ((.cse104 (mod .cse103 4))) (let ((.cse100 (store .cse105 .cse106 .cse104))) (let ((.cse101 (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_#in~arg#1.base| (store .cse100 (+ |c_ULTIMATE.start_writer_fn_#in~arg#1.offset| 4 (* .cse104 4)) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse102 (select .cse101 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_#in~arg#1.base| .cse100) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse13))) (< v_ArrVal_142 2) (= (select .cse101 .cse10) .cse102) (< 0 (select .cse101 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* 4 .cse102) 4))) (< v_ArrVal_138 1) (< .cse103 0))))))))) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse113 (store .cse107 .cse108 v_ArrVal_138))) (let ((.cse110 (mod (+ (select .cse113 .cse106) 1) 4))) (let ((.cse109 (store .cse113 .cse106 .cse110))) (let ((.cse111 (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_#in~arg#1.base| (store .cse109 (+ |c_ULTIMATE.start_writer_fn_#in~arg#1.offset| 4 (* .cse110 4)) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse112 (select .cse111 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_#in~arg#1.base| .cse109) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse13))) (not (= .cse110 0)) (< v_ArrVal_142 2) (= (select .cse111 .cse10) .cse112) (< 0 (select .cse111 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* 4 .cse112) 4))) (< v_ArrVal_138 1)))))))) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse119 (store .cse107 .cse108 v_ArrVal_138))) (let ((.cse114 (+ (select .cse119 .cse106) 1))) (let ((.cse118 (mod .cse114 4))) (let ((.cse117 (store .cse119 .cse106 (+ (- 4) .cse118)))) (let ((.cse115 (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_#in~arg#1.base| (store .cse117 (+ |c_ULTIMATE.start_writer_fn_#in~arg#1.offset| (- 12) (* .cse118 4)) v_ArrVal_142)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse116 (select .cse115 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (<= 0 .cse114) (= (select .cse115 .cse10) .cse116) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_#in~arg#1.base| .cse117) |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse13))) (< v_ArrVal_142 2) (= .cse118 0) (< v_ArrVal_138 1) (< 0 (select .cse115 (+ (* .cse116 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))))))))))))) (and (< .cse121 0) (not .cse122) (= (+ 4 .cse123) .cse124)) (and (= .cse124 .cse123) (or .cse122 (<= 0 .cse121)))))))))))))))) is different from true [2023-01-10 12:45:10,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:45:23,190 WARN L222 SmtUtils]: Spent 7.80s on a formula simplification that was a NOOP. DAG size: 179 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 12:45:59,787 WARN L222 SmtUtils]: Spent 28.51s on a formula simplification that was a NOOP. DAG size: 195 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 12:46:01,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:46:04,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:47:59,820 WARN L222 SmtUtils]: Spent 1.87m on a formula simplification. DAG size of input: 208 DAG size of output: 207 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 12:48:02,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:49:40,902 WARN L222 SmtUtils]: Spent 1.50m on a formula simplification. DAG size of input: 215 DAG size of output: 215 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 12:49:42,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:49:45,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:49:47,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:49:49,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:51:14,267 WARN L222 SmtUtils]: Spent 1.20m on a formula simplification that was a NOOP. DAG size: 193 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 12:51:16,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:51:18,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:51:21,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:51:23,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:51:25,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:51:27,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:51:29,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:51:31,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:51:34,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:51:36,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:51:38,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:51:40,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:51:42,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:51:45,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:51:47,189 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse10 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (let ((.cse96 (select .cse11 .cse10))) (let ((.cse12 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |c_ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4)) (.cse2 (+ 20 |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.offset|)) (.cse6 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 20)) (.cse0 (+ |c_ULTIMATE.start_writer_fn_~i~1#1| 2)) (.cse8 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 20)) (.cse25 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 4 (* .cse96 4)))) (and (forall ((v_ArrVal_142 Int)) (or (< v_ArrVal_142 .cse0) (forall ((v_ArrVal_138 Int)) (let ((.cse9 (store .cse11 .cse12 v_ArrVal_138))) (let ((.cse3 (+ (select .cse9 .cse10) 1))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse9 .cse10 (mod .cse3 4))))) (let ((.cse5 (select (store .cse1 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (let ((.cse7 (select .cse1 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (store .cse7 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select .cse7 .cse8) 4) 4) v_ArrVal_142))) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse4 (select .cse5 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select .cse1 |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse2))) (< .cse3 0) (< v_ArrVal_138 |c_ULTIMATE.start_ring_enqueue_~x#1|) (= .cse4 (select .cse5 .cse6)) (< 0 (select .cse5 (+ (* .cse4 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))))))))))) (forall ((v_ArrVal_142 Int)) (or (forall ((v_ArrVal_138 Int)) (let ((.cse18 (store .cse11 .cse12 v_ArrVal_138))) (let ((.cse13 (mod (+ (select .cse18 .cse10) 1) 4))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse18 .cse10 .cse13)))) (let ((.cse16 (select (store .cse14 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (let ((.cse17 (select .cse14 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (store .cse17 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select .cse17 .cse8) 4) 4) v_ArrVal_142))) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse15 (select .cse16 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (not (= 0 .cse13)) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select .cse14 |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse2))) (< v_ArrVal_138 |c_ULTIMATE.start_ring_enqueue_~x#1|) (= .cse15 (select .cse16 .cse6)) (< 0 (select .cse16 (+ (* .cse15 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))))))))) (< v_ArrVal_142 .cse0))) (forall ((v_ArrVal_142 Int)) (or (< v_ArrVal_142 .cse0) (forall ((v_ArrVal_138 Int)) (let ((.cse24 (store .cse11 .cse25 v_ArrVal_138))) (let ((.cse22 (mod (+ (select .cse24 .cse10) 1) 4))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse24 .cse10 .cse22)))) (let ((.cse20 (select (store .cse19 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (let ((.cse23 (select .cse19 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (store .cse23 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 4 (* (select .cse23 .cse8) 4)) v_ArrVal_142))) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse21 (select .cse20 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select .cse19 |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse2))) (< 0 (select .cse20 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse21 4) 4))) (= (select .cse20 .cse6) .cse21) (not (= .cse22 0)) (< v_ArrVal_138 |c_ULTIMATE.start_ring_enqueue_~x#1|)))))))))) (let ((.cse37 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base|)) (.cse36 (+ 20 |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|))) (let ((.cse52 (select .cse37 .cse36))) (let ((.cse27 (+ 1 .cse52))) (let ((.cse28 (mod .cse27 4))) (let ((.cse26 (= .cse28 0)) (.cse29 (select .cse37 |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|))) (or (and (not .cse26) (< .cse27 0) (= .cse28 (+ 4 .cse29))) (and (or .cse26 (<= 0 .cse27)) (= .cse28 .cse29)) (let ((.cse38 (+ (* 4 .cse52) 4 |c_ULTIMATE.start_ring_enqueue_#in~r#1.offset|))) (and (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse35 (store .cse37 .cse38 v_ArrVal_138))) (let ((.cse33 (mod (+ (select .cse35 .cse36) 1) 4))) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| (store .cse35 .cse36 .cse33)))) (let ((.cse30 (select (store .cse32 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (let ((.cse34 (select .cse32 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (store .cse34 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select .cse34 .cse8) 4) 4) v_ArrVal_142))) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse31 (select .cse30 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< v_ArrVal_138 |c_ULTIMATE.start_ring_enqueue_#in~x#1|) (< 0 (select .cse30 (+ (* .cse31 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))) (= .cse31 (select .cse30 .cse6)) (< v_ArrVal_142 .cse0) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select .cse32 |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse2))) (not (= .cse33 0))))))))) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse45 (store .cse37 .cse38 v_ArrVal_138))) (let ((.cse39 (+ (select .cse45 .cse36) 1))) (let ((.cse40 (mod .cse39 4))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| (store .cse45 .cse36 (+ (- 4) .cse40))))) (let ((.cse42 (select (store .cse41 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (let ((.cse44 (select .cse41 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (store .cse44 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 4 (* (select .cse44 .cse8) 4)) v_ArrVal_142))) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse43 (select .cse42 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< v_ArrVal_138 |c_ULTIMATE.start_ring_enqueue_#in~x#1|) (<= 0 .cse39) (= .cse40 0) (not (= (select (select .cse41 |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse2) |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1|)) (< 0 (select .cse42 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse43 4) 4))) (< v_ArrVal_142 .cse0) (= .cse43 (select .cse42 .cse6)))))))))) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse51 (store .cse37 .cse38 v_ArrVal_138))) (let ((.cse48 (+ (select .cse51 .cse36) 1))) (let ((.cse49 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_#in~r#1.base| (store .cse51 .cse36 (mod .cse48 4))))) (let ((.cse46 (select (store .cse49 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (let ((.cse50 (select .cse49 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (store .cse50 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* (select .cse50 .cse8) 4) 4) v_ArrVal_142))) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse47 (select .cse46 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< v_ArrVal_138 |c_ULTIMATE.start_ring_enqueue_#in~x#1|) (< 0 (select .cse46 (+ (* .cse47 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))) (< .cse48 0) (= .cse47 (select .cse46 .cse6)) (< v_ArrVal_142 .cse0) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select .cse49 |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse2)))))))))))))))))) (forall ((v_ArrVal_142 Int)) (or (forall ((v_ArrVal_138 Int)) (let ((.cse58 (store .cse11 .cse25 v_ArrVal_138))) (let ((.cse56 (+ (select .cse58 .cse10) 1))) (let ((.cse53 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse58 .cse10 (mod .cse56 4))))) (let ((.cse54 (select (store .cse53 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (let ((.cse57 (select .cse53 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (store .cse57 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 4 (* (select .cse57 .cse8) 4)) v_ArrVal_142))) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse55 (select .cse54 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select .cse53 |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse2))) (< 0 (select .cse54 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse55 4) 4))) (= (select .cse54 .cse6) .cse55) (< v_ArrVal_138 |c_ULTIMATE.start_ring_enqueue_~x#1|) (< .cse56 0)))))))) (< v_ArrVal_142 .cse0))) (forall ((v_ArrVal_138 Int)) (let ((.cse65 (store .cse11 .cse12 v_ArrVal_138))) (let ((.cse60 (+ (select .cse65 .cse10) 1))) (let ((.cse59 (mod .cse60 4))) (let ((.cse63 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse65 .cse10 (+ (- 4) .cse59))))) (or (= 0 .cse59) (< v_ArrVal_138 |c_ULTIMATE.start_ring_enqueue_~x#1|) (<= 0 .cse60) (forall ((v_ArrVal_142 Int)) (let ((.cse61 (select (store .cse63 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (let ((.cse64 (select .cse63 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (store .cse64 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* 4 (select .cse64 .cse8)) 4) v_ArrVal_142))) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse62 (select .cse61 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< v_ArrVal_142 .cse0) (< 0 (select .cse61 (+ (* .cse62 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))) (= .cse62 (select .cse61 .cse6)))))) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select .cse63 |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse2))))))))) (forall ((v_ArrVal_138 Int)) (let ((.cse72 (store .cse11 .cse25 v_ArrVal_138))) (let ((.cse71 (+ (select .cse72 .cse10) 1))) (let ((.cse70 (mod .cse71 4))) (let ((.cse68 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse72 .cse10 (+ (- 4) .cse70))))) (or (forall ((v_ArrVal_142 Int)) (let ((.cse66 (select (store .cse68 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (let ((.cse69 (select .cse68 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (store .cse69 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* 4 (select .cse69 .cse8)) 4) v_ArrVal_142))) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse67 (select .cse66 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< 0 (select .cse66 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse67 4) 4))) (< v_ArrVal_142 .cse0) (= .cse67 (select .cse66 .cse6)))))) (= .cse70 0) (< v_ArrVal_138 |c_ULTIMATE.start_ring_enqueue_~x#1|) (not (= (select (select .cse68 |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse2) |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1|)) (<= 0 .cse71))))))) (let ((.cse93 (+ .cse96 1))) (let ((.cse94 (mod .cse93 4))) (let ((.cse92 (= .cse94 0)) (.cse95 (select .cse11 |c_ULTIMATE.start_ring_enqueue_~r#1.offset|))) (or (and (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse79 (store .cse11 .cse25 v_ArrVal_138))) (let ((.cse77 (+ (select .cse79 .cse10) 1))) (let ((.cse73 (mod .cse77 4))) (let ((.cse76 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse79 .cse10 (+ (- 4) .cse73))))) (let ((.cse74 (select (store .cse76 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (let ((.cse78 (select .cse76 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (store .cse78 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* 4 (select .cse78 .cse8)) 4) v_ArrVal_142))) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse75 (select .cse74 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< v_ArrVal_138 |c_ULTIMATE.start_ring_enqueue_#in~x#1|) (= .cse73 0) (< 0 (select .cse74 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse75 4) 4))) (< v_ArrVal_142 .cse0) (= .cse75 (select .cse74 .cse6)) (not (= (select (select .cse76 |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse2) |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1|)) (<= 0 .cse77))))))))) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse85 (store .cse11 .cse25 v_ArrVal_138))) (let ((.cse83 (+ (select .cse85 .cse10) 1))) (let ((.cse80 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse85 .cse10 (mod .cse83 4))))) (let ((.cse81 (select (store .cse80 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (let ((.cse84 (select .cse80 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (store .cse84 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 4 (* (select .cse84 .cse8) 4)) v_ArrVal_142))) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse82 (select .cse81 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< v_ArrVal_138 |c_ULTIMATE.start_ring_enqueue_#in~x#1|) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select .cse80 |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse2))) (< 0 (select .cse81 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse82 4) 4))) (= (select .cse81 .cse6) .cse82) (< v_ArrVal_142 .cse0) (< .cse83 0)))))))) (forall ((v_ArrVal_142 Int) (v_ArrVal_138 Int)) (let ((.cse91 (store .cse11 .cse25 v_ArrVal_138))) (let ((.cse89 (mod (+ (select .cse91 .cse10) 1) 4))) (let ((.cse86 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store .cse91 .cse10 .cse89)))) (let ((.cse87 (select (store .cse86 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (let ((.cse90 (select .cse86 |c_ULTIMATE.start_writer_fn_~r~1#1.base|))) (store .cse90 (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| 4 (* (select .cse90 .cse8) 4)) v_ArrVal_142))) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse88 (select .cse87 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|))) (or (< v_ArrVal_138 |c_ULTIMATE.start_ring_enqueue_#in~x#1|) (not (= |c_reader_twoThread1of1ForFork0_ring_empty_#t~mem11#1| (select (select .cse86 |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) .cse2))) (< 0 (select .cse87 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* .cse88 4) 4))) (= (select .cse87 .cse6) .cse88) (not (= .cse89 0)) (< v_ArrVal_142 .cse0))))))))) (and (not .cse92) (< .cse93 0) (= .cse94 (+ .cse95 4))) (and (or (<= 0 .cse93) .cse92) (= .cse94 .cse95)))))))))) is different from true [2023-01-10 12:52:16,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:52:24,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:52:30,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:52:32,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:52:37,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:52:41,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:52:44,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:52:59,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:53:02,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:53:04,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:53:07,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:53:09,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:53:11,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:53:13,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:53:16,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:53:18,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:53:21,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:53:23,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:53:25,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:53:27,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-01-10 12:53:29,809 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-10 12:53:29,810 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-01-10 12:53:29,810 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-10 12:53:29,809 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-10 12:53:29,809 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-10 12:53:29,809 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-01-10 12:53:29,809 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-01-10 12:53:29,809 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-10 12:53:29,809 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-10 12:53:29,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 12:53:30,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-01-10 12:53:30,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2023-01-10 12:53:30,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Ended with exit code 0 [2023-01-10 12:53:30,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Ended with exit code 0 [2023-01-10 12:53:30,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Ended with exit code 0 [2023-01-10 12:53:30,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Ended with exit code 0 [2023-01-10 12:53:30,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Ended with exit code 0 [2023-01-10 12:53:30,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0 [2023-01-10 12:53:31,015 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-01-10 12:53:31,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-01-10 12:53:31,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-10 12:53:31,049 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-01-10 12:53:31,049 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-01-10 12:53:31,053 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-01-10 12:53:31,053 INFO L307 ceAbstractionStarter]: Result for error location reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (7/10) [2023-01-10 12:53:31,055 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-10 12:53:31,056 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-10 12:53:31,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:53:31 BasicIcfg [2023-01-10 12:53:31,061 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-10 12:53:31,061 INFO L158 Benchmark]: Toolchain (without parser) took 845050.18ms. Allocated memory was 218.1MB in the beginning and 852.5MB in the end (delta: 634.4MB). Free memory was 177.1MB in the beginning and 502.2MB in the end (delta: -325.1MB). Peak memory consumption was 592.3MB. Max. memory is 8.0GB. [2023-01-10 12:53:31,061 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 181.4MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-01-10 12:53:31,062 INFO L158 Benchmark]: CACSL2BoogieTranslator took 631.12ms. Allocated memory is still 218.1MB. Free memory was 176.6MB in the beginning and 143.1MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2023-01-10 12:53:31,063 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.73ms. Allocated memory is still 218.1MB. Free memory was 143.1MB in the beginning and 139.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-01-10 12:53:31,064 INFO L158 Benchmark]: Boogie Preprocessor took 56.24ms. Allocated memory is still 218.1MB. Free memory was 139.9MB in the beginning and 137.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-01-10 12:53:31,064 INFO L158 Benchmark]: RCFGBuilder took 611.60ms. Allocated memory was 218.1MB in the beginning and 270.5MB in the end (delta: 52.4MB). Free memory was 137.8MB in the beginning and 234.8MB in the end (delta: -96.9MB). Peak memory consumption was 28.4MB. Max. memory is 8.0GB. [2023-01-10 12:53:31,064 INFO L158 Benchmark]: TraceAbstraction took 843678.93ms. Allocated memory was 270.5MB in the beginning and 852.5MB in the end (delta: 582.0MB). Free memory was 234.2MB in the beginning and 502.2MB in the end (delta: -268.0MB). Peak memory consumption was 596.5MB. Max. memory is 8.0GB. [2023-01-10 12:53:31,070 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.31ms. Allocated memory is still 181.4MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 631.12ms. Allocated memory is still 218.1MB. Free memory was 176.6MB in the beginning and 143.1MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.73ms. Allocated memory is still 218.1MB. Free memory was 143.1MB in the beginning and 139.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 56.24ms. Allocated memory is still 218.1MB. Free memory was 139.9MB in the beginning and 137.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 611.60ms. Allocated memory was 218.1MB in the beginning and 270.5MB in the end (delta: 52.4MB). Free memory was 137.8MB in the beginning and 234.8MB in the end (delta: -96.9MB). Peak memory consumption was 28.4MB. Max. memory is 8.0GB. * TraceAbstraction took 843678.93ms. Allocated memory was 270.5MB in the beginning and 852.5MB in the end (delta: 582.0MB). Free memory was 234.2MB in the beginning and 502.2MB in the end (delta: -268.0MB). Peak memory consumption was 596.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Traversal Statistics Data States: 0, Transitions: 0, Traversal time: 2112324183191078.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Traversal Statistics Data States: 0, Transitions: 0, Traversal time: 2112324210906979.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Traversal Statistics Data States: 0, Transitions: 0, Traversal time: 2112324248882241.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Traversal Statistics Data States: 0, Transitions: 0, Traversal time: 2112324273010195.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 635, independent: 524, independent conditional: 524, independent unconditional: 0, dependent: 111, dependent conditional: 111, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 542, independent: 524, independent conditional: 524, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 542, independent: 524, independent conditional: 524, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 542, independent: 524, independent conditional: 0, independent unconditional: 524, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 542, independent: 524, independent conditional: 0, independent unconditional: 524, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 542, independent: 524, independent conditional: 0, independent unconditional: 524, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 520, independent: 502, independent conditional: 0, independent unconditional: 502, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 520, independent: 502, independent conditional: 0, independent unconditional: 502, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 82, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 542, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 520, unknown conditional: 0, unknown unconditional: 520] , Statistics on independence cache: Total cache size (in pairs): 520, Positive cache size: 502, Positive conditional cache size: 0, Positive unconditional cache size: 502, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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: 93 - StatisticsResult: Traversal Statistics Data States: 543, Transitions: 621, Traversal time: 233477081.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 25 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Traversal Statistics Data States: 35, Transitions: 34, Traversal time: 2193082.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 164053, independent: 150724, independent conditional: 150724, independent unconditional: 0, dependent: 13329, dependent conditional: 13329, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 152126, independent: 150724, independent conditional: 150724, independent unconditional: 0, dependent: 1402, dependent conditional: 1402, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 152126, independent: 150724, independent conditional: 150724, independent unconditional: 0, dependent: 1402, dependent conditional: 1402, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 154370, independent: 150724, independent conditional: 2, independent unconditional: 150722, dependent: 3646, dependent conditional: 2242, dependent unconditional: 1404, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 154370, independent: 150724, independent conditional: 2, independent unconditional: 150722, dependent: 3646, dependent conditional: 541, dependent unconditional: 3105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 154370, independent: 150724, independent conditional: 2, independent unconditional: 150722, dependent: 3646, dependent conditional: 541, dependent unconditional: 3105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2672, independent: 2507, independent conditional: 2, independent unconditional: 2505, dependent: 165, dependent conditional: 137, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2672, independent: 2503, independent conditional: 0, independent unconditional: 2503, dependent: 169, dependent conditional: 0, dependent unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 169, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 165, dependent conditional: 137, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 169, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 165, dependent conditional: 137, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 609, independent: 8, independent conditional: 5, independent unconditional: 3, dependent: 601, dependent conditional: 496, dependent unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 154370, independent: 148217, independent conditional: 0, independent unconditional: 148217, dependent: 3481, dependent conditional: 404, dependent unconditional: 3077, unknown: 2672, unknown conditional: 139, unknown unconditional: 2533] , Statistics on independence cache: Total cache size (in pairs): 2672, Positive cache size: 2507, Positive conditional cache size: 2, Positive unconditional cache size: 2505, Negative cache size: 165, Negative conditional cache size: 137, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1701, Maximal queried relation: 3, Independence queries for same thread: 11927 - StatisticsResult: Traversal Statistics Data States: 1438, Transitions: 1887, Traversal time: 204170275.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 38 - StatisticsResult: Traversal Statistics Data States: 19239, Transitions: 25824, Traversal time: 2664515517.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 530 - StatisticsResult: Traversal Statistics Data States: 33271, Transitions: 43816, Traversal time: 38001405407.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 1130 - StatisticsResult: Traversal Statistics Data States: 2366, Transitions: 3249, Traversal time: 590622831574.0ns - TimeoutResultAtElement [Line: 1060]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - PositiveResult [Line: 1061]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1064]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1065]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 312 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 41624875.0ns, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 4181724.0ns, FeasibilityCheckTime: 0.0ns, RefinementTime: 0.0ns, AutomataDifference: 0.0ns, DeadEndRemovalTime: 0.0ns, HoareAnnotationTime: 0.0ns, InitialAbstractionConstructionTime: 15606124.0ns, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0ns 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.0ns DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION with 2 thread instances CFG has 5 procedures, 312 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 843003565039.0ns, OverallIterations: 3, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 634589629180.0ns, FeasibilityCheckTime: 208167467204.0ns, RefinementTime: 33884700.0ns, AutomataDifference: 0.0ns, DeadEndRemovalTime: 0.0ns, HoareAnnotationTime: 0.0ns, InitialAbstractionConstructionTime: 1872672.0ns, HoareTripleCheckerStatistics: 43 mSolverCounterUnknown, 10803 SdHoareTripleChecker+Valid, 175483561806.0ns IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10803 mSDsluCounter, 37376 SdHoareTripleChecker+Invalid, 171416240434.0ns Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 12901 IncrementalHoareTripleChecker+Unchecked, 36055 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14751 IncrementalHoareTripleChecker+Invalid, 27788 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 1321 mSDtfsCounter, 14751 mSolverCounterSat, 236340982.0ns SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: No data available, 0.0ns BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 162, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ns DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 58170365.0ns SsaConstructionTime, 306297886.0ns SatisfiabilityAnalysisTime, 207512939385.0ns InterpolantComputationTime, 613 NumberOfCodeBlocks, 613 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 872 ConstructedInterpolants, 158 QuantifiedInterpolants, 114832 SizeOfPredicates, 97 NumberOfNonLiveVariables, 697 ConjunctsInSsa, 235 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 0/114 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 - StatisticsResult: Ultimate Automizer benchmark data for error location: reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 312 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 7936157.0ns, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 217685.0ns, FeasibilityCheckTime: 0.0ns, RefinementTime: 0.0ns, AutomataDifference: 0.0ns, DeadEndRemovalTime: 0.0ns, HoareAnnotationTime: 0.0ns, InitialAbstractionConstructionTime: 4165174.0ns, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0ns 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.0ns DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 312 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 7845663.0ns, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 205931.0ns, FeasibilityCheckTime: 0.0ns, RefinementTime: 0.0ns, AutomataDifference: 0.0ns, DeadEndRemovalTime: 0.0ns, HoareAnnotationTime: 0.0ns, InitialAbstractionConstructionTime: 4477337.0ns, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0ns 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.0ns DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 312 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 9758292.0ns, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 225769.0ns, FeasibilityCheckTime: 0.0ns, RefinementTime: 0.0ns, AutomataDifference: 0.0ns, DeadEndRemovalTime: 0.0ns, HoareAnnotationTime: 0.0ns, InitialAbstractionConstructionTime: 6237345.0ns, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0ns 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.0ns DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 312 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 271292921.0ns, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 256436633.0ns, FeasibilityCheckTime: 0.0ns, RefinementTime: 0.0ns, AutomataDifference: 0.0ns, DeadEndRemovalTime: 0.0ns, HoareAnnotationTime: 0.0ns, InitialAbstractionConstructionTime: 11165268.0ns, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0ns 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.0ns DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 312 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 7249840.0ns, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 2606438.0ns, FeasibilityCheckTime: 0.0ns, RefinementTime: 0.0ns, AutomataDifference: 0.0ns, DeadEndRemovalTime: 0.0ns, HoareAnnotationTime: 0.0ns, InitialAbstractionConstructionTime: 2222807.0ns, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0ns 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.0ns DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown