./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 21:40:29,454 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 21:40:29,456 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 21:40:29,499 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 21:40:29,499 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 21:40:29,501 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 21:40:29,503 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 21:40:29,505 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 21:40:29,507 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 21:40:29,507 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 21:40:29,508 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 21:40:29,510 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 21:40:29,511 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 21:40:29,515 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 21:40:29,516 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 21:40:29,518 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 21:40:29,519 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 21:40:29,520 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 21:40:29,521 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 21:40:29,526 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 21:40:29,528 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 21:40:29,529 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 21:40:29,529 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 21:40:29,530 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 21:40:29,532 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 21:40:29,538 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 21:40:29,538 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 21:40:29,538 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 21:40:29,539 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 21:40:29,540 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 21:40:29,540 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 21:40:29,541 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 21:40:29,542 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 21:40:29,543 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 21:40:29,543 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 21:40:29,544 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 21:40:29,544 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 21:40:29,545 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 21:40:29,545 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 21:40:29,545 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 21:40:29,546 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 21:40:29,547 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 21:40:29,548 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 21:40:29,572 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 21:40:29,573 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 21:40:29,573 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 21:40:29,573 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 21:40:29,574 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 21:40:29,574 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 21:40:29,575 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 21:40:29,575 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 21:40:29,575 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 21:40:29,576 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 21:40:29,576 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 21:40:29,576 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 21:40:29,577 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 21:40:29,577 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 21:40:29,577 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 21:40:29,577 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 21:40:29,577 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 21:40:29,578 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 21:40:29,578 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 21:40:29,578 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 21:40:29,578 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 21:40:29,578 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 21:40:29,579 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 21:40:29,579 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 21:40:29,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 21:40:29,579 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 21:40:29,579 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 21:40:29,580 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 21:40:29,580 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 21:40:29,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 21:40:29,580 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 21:40:29,580 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 21:40:29,581 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 21:40:29,581 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 [2022-07-13 21:40:29,812 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 21:40:29,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 21:40:29,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 21:40:29,842 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 21:40:29,842 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 21:40:29,843 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2022-07-13 21:40:29,904 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2873f9259/614ec6955bb74c0f928d409254bd926f/FLAG5f35865d0 [2022-07-13 21:40:30,300 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 21:40:30,301 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2022-07-13 21:40:30,310 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2873f9259/614ec6955bb74c0f928d409254bd926f/FLAG5f35865d0 [2022-07-13 21:40:30,321 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2873f9259/614ec6955bb74c0f928d409254bd926f [2022-07-13 21:40:30,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 21:40:30,325 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 21:40:30,326 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 21:40:30,326 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 21:40:30,332 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 21:40:30,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 09:40:30" (1/1) ... [2022-07-13 21:40:30,334 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3107ad5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:40:30, skipping insertion in model container [2022-07-13 21:40:30,334 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 09:40:30" (1/1) ... [2022-07-13 21:40:30,339 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 21:40:30,372 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 21:40:30,539 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-07-13 21:40:30,656 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i[31244,31257] [2022-07-13 21:40:30,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 21:40:30,683 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 21:40:30,707 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-07-13 21:40:30,724 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i[31244,31257] [2022-07-13 21:40:30,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 21:40:30,758 INFO L208 MainTranslator]: Completed translation [2022-07-13 21:40:30,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:40:30 WrapperNode [2022-07-13 21:40:30,758 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 21:40:30,759 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 21:40:30,760 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 21:40:30,760 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 21:40:30,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:40:30" (1/1) ... [2022-07-13 21:40:30,782 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:40:30" (1/1) ... [2022-07-13 21:40:30,801 INFO L137 Inliner]: procedures = 174, calls = 51, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 119 [2022-07-13 21:40:30,801 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 21:40:30,802 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 21:40:30,802 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 21:40:30,802 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 21:40:30,809 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:40:30" (1/1) ... [2022-07-13 21:40:30,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:40:30" (1/1) ... [2022-07-13 21:40:30,812 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:40:30" (1/1) ... [2022-07-13 21:40:30,812 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:40:30" (1/1) ... [2022-07-13 21:40:30,818 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:40:30" (1/1) ... [2022-07-13 21:40:30,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:40:30" (1/1) ... [2022-07-13 21:40:30,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:40:30" (1/1) ... [2022-07-13 21:40:30,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 21:40:30,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 21:40:30,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 21:40:30,831 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 21:40:30,833 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:40:30" (1/1) ... [2022-07-13 21:40:30,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 21:40:30,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:40:30,858 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 21:40:30,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 21:40:30,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 21:40:30,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 21:40:30,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-13 21:40:30,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 21:40:30,886 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2022-07-13 21:40:30,886 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2022-07-13 21:40:30,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 21:40:30,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 21:40:30,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 21:40:30,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-13 21:40:30,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 21:40:30,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 21:40:30,887 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2022-07-13 21:40:30,887 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2022-07-13 21:40:30,888 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-13 21:40:30,974 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 21:40:30,976 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 21:40:31,163 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 21:40:31,188 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 21:40:31,188 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-13 21:40:31,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:40:31 BoogieIcfgContainer [2022-07-13 21:40:31,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 21:40:31,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 21:40:31,192 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 21:40:31,202 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 21:40:31,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 09:40:30" (1/3) ... [2022-07-13 21:40:31,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e559717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 09:40:31, skipping insertion in model container [2022-07-13 21:40:31,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:40:30" (2/3) ... [2022-07-13 21:40:31,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e559717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 09:40:31, skipping insertion in model container [2022-07-13 21:40:31,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:40:31" (3/3) ... [2022-07-13 21:40:31,205 INFO L111 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2022-07-13 21:40:31,210 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-13 21:40:31,227 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 21:40:31,227 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 21:40:31,227 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-13 21:40:31,318 INFO L135 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-07-13 21:40:31,354 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 125 places, 114 transitions, 260 flow [2022-07-13 21:40:31,412 INFO L129 PetriNetUnfolder]: 2/110 cut-off events. [2022-07-13 21:40:31,412 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-07-13 21:40:31,417 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 110 events. 2/110 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-07-13 21:40:31,418 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 114 transitions, 260 flow [2022-07-13 21:40:31,424 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 96 transitions, 213 flow [2022-07-13 21:40:31,442 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 21:40:31,449 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@797b14f8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3a694592 [2022-07-13 21:40:31,449 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-07-13 21:40:31,468 INFO L129 PetriNetUnfolder]: 1/58 cut-off events. [2022-07-13 21:40:31,469 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-13 21:40:31,469 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:40:31,470 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:40:31,471 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:40:31,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:40:31,476 INFO L85 PathProgramCache]: Analyzing trace with hash 2006515335, now seen corresponding path program 1 times [2022-07-13 21:40:31,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:40:31,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543855196] [2022-07-13 21:40:31,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:40:31,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:40:31,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:40:31,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:40:31,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:40:31,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543855196] [2022-07-13 21:40:31,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543855196] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:40:31,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:40:31,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:40:31,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337701129] [2022-07-13 21:40:31,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:40:31,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:40:31,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:40:31,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:40:31,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:40:31,815 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114 [2022-07-13 21:40:31,821 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 96 transitions, 213 flow. Second operand has 6 states, 6 states have (on average 84.83333333333333) internal successors, (509), 6 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:31,822 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:40:31,822 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114 [2022-07-13 21:40:31,823 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:40:32,983 INFO L129 PetriNetUnfolder]: 3525/7769 cut-off events. [2022-07-13 21:40:32,983 INFO L130 PetriNetUnfolder]: For 1654/1654 co-relation queries the response was YES. [2022-07-13 21:40:33,008 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13923 conditions, 7769 events. 3525/7769 cut-off events. For 1654/1654 co-relation queries the response was YES. Maximal size of possible extension queue 563. Compared 71761 event pairs, 961 based on Foata normal form. 422/7837 useless extension candidates. Maximal degree in co-relation 13398. Up to 1729 conditions per place. [2022-07-13 21:40:33,084 INFO L132 encePairwiseOnDemand]: 102/114 looper letters, 116 selfloop transitions, 32 changer transitions 0/214 dead transitions. [2022-07-13 21:40:33,085 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 214 transitions, 823 flow [2022-07-13 21:40:33,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 21:40:33,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-07-13 21:40:33,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1160 transitions. [2022-07-13 21:40:33,103 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.847953216374269 [2022-07-13 21:40:33,104 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1160 transitions. [2022-07-13 21:40:33,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1160 transitions. [2022-07-13 21:40:33,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:40:33,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1160 transitions. [2022-07-13 21:40:33,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 96.66666666666667) internal successors, (1160), 12 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:33,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:33,125 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:33,127 INFO L186 Difference]: Start difference. First operand has 107 places, 96 transitions, 213 flow. Second operand 12 states and 1160 transitions. [2022-07-13 21:40:33,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 214 transitions, 823 flow [2022-07-13 21:40:33,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 214 transitions, 764 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-07-13 21:40:33,155 INFO L242 Difference]: Finished difference. Result has 119 places, 129 transitions, 416 flow [2022-07-13 21:40:33,156 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=416, PETRI_PLACES=119, PETRI_TRANSITIONS=129} [2022-07-13 21:40:33,159 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 12 predicate places. [2022-07-13 21:40:33,159 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 129 transitions, 416 flow [2022-07-13 21:40:33,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.83333333333333) internal successors, (509), 6 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:33,160 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:40:33,160 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:40:33,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 21:40:33,161 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:40:33,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:40:33,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1738116757, now seen corresponding path program 1 times [2022-07-13 21:40:33,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:40:33,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124967125] [2022-07-13 21:40:33,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:40:33,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:40:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:40:33,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:40:33,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:40:33,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124967125] [2022-07-13 21:40:33,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124967125] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:40:33,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:40:33,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 21:40:33,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598731154] [2022-07-13 21:40:33,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:40:33,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:40:33,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:40:33,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:40:33,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 21:40:33,220 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 114 [2022-07-13 21:40:33,220 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 129 transitions, 416 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:33,221 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:40:33,221 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 114 [2022-07-13 21:40:33,221 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:40:33,488 INFO L129 PetriNetUnfolder]: 398/2267 cut-off events. [2022-07-13 21:40:33,489 INFO L130 PetriNetUnfolder]: For 379/391 co-relation queries the response was YES. [2022-07-13 21:40:33,501 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3864 conditions, 2267 events. 398/2267 cut-off events. For 379/391 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 22152 event pairs, 93 based on Foata normal form. 51/2197 useless extension candidates. Maximal degree in co-relation 3549. Up to 251 conditions per place. [2022-07-13 21:40:33,511 INFO L132 encePairwiseOnDemand]: 108/114 looper letters, 15 selfloop transitions, 4 changer transitions 0/134 dead transitions. [2022-07-13 21:40:33,512 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 134 transitions, 470 flow [2022-07-13 21:40:33,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:40:33,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-13 21:40:33,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2022-07-13 21:40:33,513 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9181286549707602 [2022-07-13 21:40:33,514 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2022-07-13 21:40:33,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2022-07-13 21:40:33,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:40:33,514 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2022-07-13 21:40:33,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:33,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:33,517 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:33,517 INFO L186 Difference]: Start difference. First operand has 119 places, 129 transitions, 416 flow. Second operand 3 states and 314 transitions. [2022-07-13 21:40:33,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 134 transitions, 470 flow [2022-07-13 21:40:33,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 134 transitions, 470 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-13 21:40:33,532 INFO L242 Difference]: Finished difference. Result has 122 places, 129 transitions, 432 flow [2022-07-13 21:40:33,532 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=432, PETRI_PLACES=122, PETRI_TRANSITIONS=129} [2022-07-13 21:40:33,533 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 15 predicate places. [2022-07-13 21:40:33,533 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 129 transitions, 432 flow [2022-07-13 21:40:33,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:33,535 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:40:33,535 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:40:33,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 21:40:33,535 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:40:33,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:40:33,536 INFO L85 PathProgramCache]: Analyzing trace with hash 195211785, now seen corresponding path program 2 times [2022-07-13 21:40:33,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:40:33,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963467452] [2022-07-13 21:40:33,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:40:33,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:40:33,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:40:33,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:40:33,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:40:33,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963467452] [2022-07-13 21:40:33,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963467452] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:40:33,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:40:33,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 21:40:33,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708707884] [2022-07-13 21:40:33,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:40:33,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 21:40:33,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:40:33,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 21:40:33,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 21:40:33,674 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114 [2022-07-13 21:40:33,674 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 129 transitions, 432 flow. Second operand has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:33,675 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:40:33,675 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114 [2022-07-13 21:40:33,675 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:40:34,275 INFO L129 PetriNetUnfolder]: 1590/4818 cut-off events. [2022-07-13 21:40:34,275 INFO L130 PetriNetUnfolder]: For 2362/2464 co-relation queries the response was YES. [2022-07-13 21:40:34,295 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10147 conditions, 4818 events. 1590/4818 cut-off events. For 2362/2464 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 48917 event pairs, 145 based on Foata normal form. 50/4728 useless extension candidates. Maximal degree in co-relation 8937. Up to 767 conditions per place. [2022-07-13 21:40:34,313 INFO L132 encePairwiseOnDemand]: 105/114 looper letters, 45 selfloop transitions, 19 changer transitions 4/175 dead transitions. [2022-07-13 21:40:34,314 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 175 transitions, 737 flow [2022-07-13 21:40:34,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 21:40:34,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-13 21:40:34,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 518 transitions. [2022-07-13 21:40:34,317 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9087719298245615 [2022-07-13 21:40:34,318 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 518 transitions. [2022-07-13 21:40:34,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 518 transitions. [2022-07-13 21:40:34,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:40:34,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 518 transitions. [2022-07-13 21:40:34,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:34,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:34,322 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:34,322 INFO L186 Difference]: Start difference. First operand has 122 places, 129 transitions, 432 flow. Second operand 5 states and 518 transitions. [2022-07-13 21:40:34,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 175 transitions, 737 flow [2022-07-13 21:40:34,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 175 transitions, 717 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-13 21:40:34,345 INFO L242 Difference]: Finished difference. Result has 124 places, 143 transitions, 510 flow [2022-07-13 21:40:34,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=510, PETRI_PLACES=124, PETRI_TRANSITIONS=143} [2022-07-13 21:40:34,347 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 17 predicate places. [2022-07-13 21:40:34,347 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 143 transitions, 510 flow [2022-07-13 21:40:34,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:34,348 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:40:34,348 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:40:34,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 21:40:34,349 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:40:34,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:40:34,349 INFO L85 PathProgramCache]: Analyzing trace with hash 579299824, now seen corresponding path program 1 times [2022-07-13 21:40:34,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:40:34,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890892745] [2022-07-13 21:40:34,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:40:34,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:40:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:40:34,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:40:34,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:40:34,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890892745] [2022-07-13 21:40:34,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890892745] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:40:34,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:40:34,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:40:34,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980471093] [2022-07-13 21:40:34,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:40:34,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:40:34,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:40:34,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:40:34,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:40:34,417 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114 [2022-07-13 21:40:34,418 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 143 transitions, 510 flow. Second operand has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:34,418 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:40:34,418 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114 [2022-07-13 21:40:34,418 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:40:36,382 INFO L129 PetriNetUnfolder]: 8131/17870 cut-off events. [2022-07-13 21:40:36,383 INFO L130 PetriNetUnfolder]: For 15561/15640 co-relation queries the response was YES. [2022-07-13 21:40:36,471 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44383 conditions, 17870 events. 8131/17870 cut-off events. For 15561/15640 co-relation queries the response was YES. Maximal size of possible extension queue 1622. Compared 195577 event pairs, 1270 based on Foata normal form. 20/17361 useless extension candidates. Maximal degree in co-relation 43808. Up to 3340 conditions per place. [2022-07-13 21:40:36,556 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 207 selfloop transitions, 134 changer transitions 25/442 dead transitions. [2022-07-13 21:40:36,556 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 442 transitions, 2686 flow [2022-07-13 21:40:36,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 21:40:36,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-07-13 21:40:36,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1151 transitions. [2022-07-13 21:40:36,560 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.841374269005848 [2022-07-13 21:40:36,560 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1151 transitions. [2022-07-13 21:40:36,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1151 transitions. [2022-07-13 21:40:36,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:40:36,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1151 transitions. [2022-07-13 21:40:36,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 95.91666666666667) internal successors, (1151), 12 states have internal predecessors, (1151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:36,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:36,570 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:36,570 INFO L186 Difference]: Start difference. First operand has 124 places, 143 transitions, 510 flow. Second operand 12 states and 1151 transitions. [2022-07-13 21:40:36,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 442 transitions, 2686 flow [2022-07-13 21:40:36,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 442 transitions, 2680 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-07-13 21:40:36,791 INFO L242 Difference]: Finished difference. Result has 143 places, 298 transitions, 1900 flow [2022-07-13 21:40:36,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1900, PETRI_PLACES=143, PETRI_TRANSITIONS=298} [2022-07-13 21:40:36,792 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 36 predicate places. [2022-07-13 21:40:36,792 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 298 transitions, 1900 flow [2022-07-13 21:40:36,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:36,793 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:40:36,793 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:40:36,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 21:40:36,793 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:40:36,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:40:36,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1097766141, now seen corresponding path program 1 times [2022-07-13 21:40:36,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:40:36,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369240185] [2022-07-13 21:40:36,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:40:36,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:40:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:40:36,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:40:36,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:40:36,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369240185] [2022-07-13 21:40:36,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369240185] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:40:36,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:40:36,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:40:36,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725538679] [2022-07-13 21:40:36,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:40:36,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:40:36,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:40:36,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:40:36,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:40:36,887 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114 [2022-07-13 21:40:36,888 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 298 transitions, 1900 flow. Second operand has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:36,888 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:40:36,888 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114 [2022-07-13 21:40:36,888 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:40:39,386 INFO L129 PetriNetUnfolder]: 9006/19880 cut-off events. [2022-07-13 21:40:39,386 INFO L130 PetriNetUnfolder]: For 29259/29357 co-relation queries the response was YES. [2022-07-13 21:40:39,504 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59351 conditions, 19880 events. 9006/19880 cut-off events. For 29259/29357 co-relation queries the response was YES. Maximal size of possible extension queue 1796. Compared 221633 event pairs, 1488 based on Foata normal form. 223/19912 useless extension candidates. Maximal degree in co-relation 58727. Up to 4759 conditions per place. [2022-07-13 21:40:39,596 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 237 selfloop transitions, 206 changer transitions 5/524 dead transitions. [2022-07-13 21:40:39,597 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 524 transitions, 4189 flow [2022-07-13 21:40:39,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 21:40:39,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-13 21:40:39,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1235 transitions. [2022-07-13 21:40:39,601 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2022-07-13 21:40:39,601 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1235 transitions. [2022-07-13 21:40:39,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1235 transitions. [2022-07-13 21:40:39,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:40:39,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1235 transitions. [2022-07-13 21:40:39,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 95.0) internal successors, (1235), 13 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:39,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:39,609 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:39,609 INFO L186 Difference]: Start difference. First operand has 143 places, 298 transitions, 1900 flow. Second operand 13 states and 1235 transitions. [2022-07-13 21:40:39,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 524 transitions, 4189 flow [2022-07-13 21:40:40,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 524 transitions, 4189 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-13 21:40:40,211 INFO L242 Difference]: Finished difference. Result has 163 places, 386 transitions, 3338 flow [2022-07-13 21:40:40,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1900, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3338, PETRI_PLACES=163, PETRI_TRANSITIONS=386} [2022-07-13 21:40:40,212 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 56 predicate places. [2022-07-13 21:40:40,213 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 386 transitions, 3338 flow [2022-07-13 21:40:40,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:40,213 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:40:40,213 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:40:40,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 21:40:40,214 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:40:40,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:40:40,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1042275993, now seen corresponding path program 1 times [2022-07-13 21:40:40,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:40:40,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495232224] [2022-07-13 21:40:40,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:40:40,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:40:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:40:40,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:40:40,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:40:40,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495232224] [2022-07-13 21:40:40,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495232224] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:40:40,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:40:40,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:40:40,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425851111] [2022-07-13 21:40:40,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:40:40,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:40:40,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:40:40,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:40:40,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:40:40,260 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114 [2022-07-13 21:40:40,261 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 386 transitions, 3338 flow. Second operand has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:40,261 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:40:40,261 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114 [2022-07-13 21:40:40,261 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:40:42,951 INFO L129 PetriNetUnfolder]: 9876/21673 cut-off events. [2022-07-13 21:40:42,951 INFO L130 PetriNetUnfolder]: For 52197/52248 co-relation queries the response was YES. [2022-07-13 21:40:43,060 INFO L84 FinitePrefix]: Finished finitePrefix Result has 71027 conditions, 21673 events. 9876/21673 cut-off events. For 52197/52248 co-relation queries the response was YES. Maximal size of possible extension queue 1940. Compared 241993 event pairs, 1828 based on Foata normal form. 239/21705 useless extension candidates. Maximal degree in co-relation 67915. Up to 5676 conditions per place. [2022-07-13 21:40:43,171 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 295 selfloop transitions, 249 changer transitions 8/643 dead transitions. [2022-07-13 21:40:43,171 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 643 transitions, 6329 flow [2022-07-13 21:40:43,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 21:40:43,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-13 21:40:43,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1239 transitions. [2022-07-13 21:40:43,174 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8360323886639676 [2022-07-13 21:40:43,174 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1239 transitions. [2022-07-13 21:40:43,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1239 transitions. [2022-07-13 21:40:43,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:40:43,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1239 transitions. [2022-07-13 21:40:43,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 95.3076923076923) internal successors, (1239), 13 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:43,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:43,182 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:43,182 INFO L186 Difference]: Start difference. First operand has 163 places, 386 transitions, 3338 flow. Second operand 13 states and 1239 transitions. [2022-07-13 21:40:43,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 643 transitions, 6329 flow [2022-07-13 21:40:44,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 643 transitions, 6261 flow, removed 18 selfloop flow, removed 1 redundant places. [2022-07-13 21:40:44,228 INFO L242 Difference]: Finished difference. Result has 182 places, 484 transitions, 5114 flow [2022-07-13 21:40:44,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=3294, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5114, PETRI_PLACES=182, PETRI_TRANSITIONS=484} [2022-07-13 21:40:44,229 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 75 predicate places. [2022-07-13 21:40:44,230 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 484 transitions, 5114 flow [2022-07-13 21:40:44,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:44,230 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:40:44,230 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:40:44,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 21:40:44,231 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:40:44,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:40:44,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1127280812, now seen corresponding path program 1 times [2022-07-13 21:40:44,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:40:44,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712441022] [2022-07-13 21:40:44,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:40:44,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:40:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:40:44,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:40:44,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:40:44,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712441022] [2022-07-13 21:40:44,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712441022] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:40:44,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:40:44,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 21:40:44,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095757001] [2022-07-13 21:40:44,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:40:44,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 21:40:44,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:40:44,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 21:40:44,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 21:40:44,311 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 114 [2022-07-13 21:40:44,312 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 484 transitions, 5114 flow. Second operand has 5 states, 5 states have (on average 96.6) internal successors, (483), 5 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:44,312 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:40:44,312 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 114 [2022-07-13 21:40:44,312 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:40:44,737 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([261] L738-2-->L741: Formula: (= (+ (- 1) v_~r~0_3) |v_readerThread1of1ForFork3_~l~0#1_7|) InVars {~r~0=v_~r~0_3} OutVars{readerThread1of1ForFork3_~l~0#1=|v_readerThread1of1ForFork3_~l~0#1_7|, ~r~0=v_~r~0_3} AuxVars[] AssignedVars[readerThread1of1ForFork3_~l~0#1][244], [Black: 171#true, Black: 241#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 182#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 244#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 234#true, Black: 180#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 254#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|)), Black: 186#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 252#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0)), Black: 173#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 246#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 188#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 237#(= ~y~0 ~x~0), Black: 178#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 133#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 118#L741true, 239#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), Black: 130#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 139#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 143#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 145#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 137#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 135#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 128#true, Black: 220#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|)), Black: 205#(= ~y~0 ~x~0), Black: 216#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 59#L754-2true, Black: 222#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 209#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 202#true, Black: 212#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 268#(= ~r~0 0), 74#L717true, 169#(and (not (= ~w~0 0)) (= ~r~0 0)), readerThread1of1ForFork3InUse, 207#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 176#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|)]) [2022-07-13 21:40:44,737 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-07-13 21:40:44,737 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-13 21:40:44,737 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-13 21:40:44,737 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-13 21:40:44,760 INFO L129 PetriNetUnfolder]: 947/3465 cut-off events. [2022-07-13 21:40:44,761 INFO L130 PetriNetUnfolder]: For 8687/8759 co-relation queries the response was YES. [2022-07-13 21:40:44,780 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10659 conditions, 3465 events. 947/3465 cut-off events. For 8687/8759 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 34487 event pairs, 124 based on Foata normal form. 114/3539 useless extension candidates. Maximal degree in co-relation 10387. Up to 547 conditions per place. [2022-07-13 21:40:44,788 INFO L132 encePairwiseOnDemand]: 107/114 looper letters, 40 selfloop transitions, 11 changer transitions 44/281 dead transitions. [2022-07-13 21:40:44,788 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 281 transitions, 2262 flow [2022-07-13 21:40:44,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 21:40:44,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-13 21:40:44,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 522 transitions. [2022-07-13 21:40:44,791 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9157894736842105 [2022-07-13 21:40:44,791 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 522 transitions. [2022-07-13 21:40:44,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 522 transitions. [2022-07-13 21:40:44,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:40:44,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 522 transitions. [2022-07-13 21:40:44,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:44,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:44,794 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:44,794 INFO L186 Difference]: Start difference. First operand has 182 places, 484 transitions, 5114 flow. Second operand 5 states and 522 transitions. [2022-07-13 21:40:44,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 281 transitions, 2262 flow [2022-07-13 21:40:44,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 281 transitions, 2219 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-07-13 21:40:44,875 INFO L242 Difference]: Finished difference. Result has 185 places, 226 transitions, 1692 flow [2022-07-13 21:40:44,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1874, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1692, PETRI_PLACES=185, PETRI_TRANSITIONS=226} [2022-07-13 21:40:44,876 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 78 predicate places. [2022-07-13 21:40:44,876 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 226 transitions, 1692 flow [2022-07-13 21:40:44,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.6) internal successors, (483), 5 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:44,877 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:40:44,877 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:40:44,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 21:40:44,877 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:40:44,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:40:44,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1072455534, now seen corresponding path program 1 times [2022-07-13 21:40:44,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:40:44,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971851804] [2022-07-13 21:40:44,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:40:44,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:40:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:40:44,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:40:44,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:40:44,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971851804] [2022-07-13 21:40:44,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971851804] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:40:44,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:40:44,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:40:44,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352117564] [2022-07-13 21:40:44,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:40:44,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:40:44,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:40:44,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:40:44,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:40:44,959 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114 [2022-07-13 21:40:44,959 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 226 transitions, 1692 flow. Second operand has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:44,959 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:40:44,960 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114 [2022-07-13 21:40:44,960 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:40:45,438 INFO L129 PetriNetUnfolder]: 879/3214 cut-off events. [2022-07-13 21:40:45,438 INFO L130 PetriNetUnfolder]: For 8924/8988 co-relation queries the response was YES. [2022-07-13 21:40:45,455 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10814 conditions, 3214 events. 879/3214 cut-off events. For 8924/8988 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 32086 event pairs, 138 based on Foata normal form. 12/3192 useless extension candidates. Maximal degree in co-relation 10370. Up to 328 conditions per place. [2022-07-13 21:40:45,461 INFO L132 encePairwiseOnDemand]: 106/114 looper letters, 55 selfloop transitions, 17 changer transitions 37/283 dead transitions. [2022-07-13 21:40:45,461 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 283 transitions, 2246 flow [2022-07-13 21:40:45,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 21:40:45,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-13 21:40:45,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 803 transitions. [2022-07-13 21:40:45,465 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8804824561403509 [2022-07-13 21:40:45,465 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 803 transitions. [2022-07-13 21:40:45,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 803 transitions. [2022-07-13 21:40:45,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:40:45,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 803 transitions. [2022-07-13 21:40:45,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 100.375) internal successors, (803), 8 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:45,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 114.0) internal successors, (1026), 9 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:45,470 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 114.0) internal successors, (1026), 9 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:45,470 INFO L186 Difference]: Start difference. First operand has 185 places, 226 transitions, 1692 flow. Second operand 8 states and 803 transitions. [2022-07-13 21:40:45,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 283 transitions, 2246 flow [2022-07-13 21:40:45,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 283 transitions, 2191 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-07-13 21:40:45,544 INFO L242 Difference]: Finished difference. Result has 189 places, 226 transitions, 1707 flow [2022-07-13 21:40:45,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1661, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1707, PETRI_PLACES=189, PETRI_TRANSITIONS=226} [2022-07-13 21:40:45,545 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 82 predicate places. [2022-07-13 21:40:45,545 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 226 transitions, 1707 flow [2022-07-13 21:40:45,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:45,546 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:40:45,546 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:40:45,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 21:40:45,546 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:40:45,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:40:45,547 INFO L85 PathProgramCache]: Analyzing trace with hash -143796270, now seen corresponding path program 2 times [2022-07-13 21:40:45,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:40:45,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908420071] [2022-07-13 21:40:45,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:40:45,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:40:45,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:40:45,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:40:45,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:40:45,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908420071] [2022-07-13 21:40:45,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908420071] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:40:45,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:40:45,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:40:45,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088320382] [2022-07-13 21:40:45,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:40:45,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:40:45,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:40:45,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:40:45,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:40:45,608 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114 [2022-07-13 21:40:45,609 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 226 transitions, 1707 flow. Second operand has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:45,609 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:40:45,609 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114 [2022-07-13 21:40:45,609 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:40:45,895 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([246] L738-2-->L741: Formula: (= (+ (- 1) v_~r~0_3) |v_readerThread1of1ForFork0_~l~0#1_7|) InVars {~r~0=v_~r~0_3} OutVars{readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_7|, ~r~0=v_~r~0_3} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][223], [Black: 241#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 171#true, Black: 244#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 182#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 288#(= ~r~0 0), Black: 234#true, Black: 180#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 254#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|)), Black: 186#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 252#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0)), Black: 173#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 246#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 188#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 274#(= ~r~0 0), Black: 237#(= ~y~0 ~x~0), Black: 178#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 133#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 239#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), Black: 130#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 139#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 143#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 145#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 137#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 135#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 128#true, Black: 275#(<= 1 ~r~0), Black: 220#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|)), Black: 205#(= ~y~0 ~x~0), Black: 216#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 222#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 209#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 202#true, Black: 212#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 43#L744true, 74#L717true, 35#L741true, 76#L753-2true, 207#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), readerThread1of1ForFork3InUse, 176#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|)]) [2022-07-13 21:40:45,896 INFO L384 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-07-13 21:40:45,896 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-13 21:40:45,896 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-13 21:40:45,896 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-13 21:40:45,928 INFO L129 PetriNetUnfolder]: 672/2660 cut-off events. [2022-07-13 21:40:45,928 INFO L130 PetriNetUnfolder]: For 7007/7077 co-relation queries the response was YES. [2022-07-13 21:40:45,947 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8709 conditions, 2660 events. 672/2660 cut-off events. For 7007/7077 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 25741 event pairs, 128 based on Foata normal form. 63/2683 useless extension candidates. Maximal degree in co-relation 8405. Up to 406 conditions per place. [2022-07-13 21:40:45,953 INFO L132 encePairwiseOnDemand]: 106/114 looper letters, 51 selfloop transitions, 14 changer transitions 23/244 dead transitions. [2022-07-13 21:40:45,953 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 244 transitions, 1889 flow [2022-07-13 21:40:45,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 21:40:45,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-13 21:40:45,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 699 transitions. [2022-07-13 21:40:45,959 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8759398496240601 [2022-07-13 21:40:45,960 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 699 transitions. [2022-07-13 21:40:45,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 699 transitions. [2022-07-13 21:40:45,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:40:45,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 699 transitions. [2022-07-13 21:40:45,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.85714285714286) internal successors, (699), 7 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:45,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:45,965 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:45,966 INFO L186 Difference]: Start difference. First operand has 189 places, 226 transitions, 1707 flow. Second operand 7 states and 699 transitions. [2022-07-13 21:40:45,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 244 transitions, 1889 flow [2022-07-13 21:40:46,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 244 transitions, 1830 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-07-13 21:40:46,022 INFO L242 Difference]: Finished difference. Result has 192 places, 203 transitions, 1418 flow [2022-07-13 21:40:46,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1457, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1418, PETRI_PLACES=192, PETRI_TRANSITIONS=203} [2022-07-13 21:40:46,023 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 85 predicate places. [2022-07-13 21:40:46,023 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 203 transitions, 1418 flow [2022-07-13 21:40:46,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:46,024 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:40:46,024 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:40:46,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 21:40:46,025 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:40:46,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:40:46,025 INFO L85 PathProgramCache]: Analyzing trace with hash 571210246, now seen corresponding path program 3 times [2022-07-13 21:40:46,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:40:46,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669082519] [2022-07-13 21:40:46,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:40:46,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:40:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:40:46,053 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 21:40:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:40:46,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 21:40:46,099 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 21:40:46,100 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-07-13 21:40:46,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-07-13 21:40:46,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-07-13 21:40:46,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-07-13 21:40:46,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-07-13 21:40:46,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-07-13 21:40:46,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-07-13 21:40:46,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 21:40:46,109 INFO L356 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1] [2022-07-13 21:40:46,115 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-13 21:40:46,115 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 21:40:46,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 09:40:46 BasicIcfg [2022-07-13 21:40:46,199 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 21:40:46,200 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 21:40:46,200 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 21:40:46,200 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 21:40:46,201 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:40:31" (3/4) ... [2022-07-13 21:40:46,202 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 21:40:46,279 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 21:40:46,280 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 21:40:46,280 INFO L158 Benchmark]: Toolchain (without parser) took 15955.60ms. Allocated memory was 96.5MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 60.4MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 980.3MB. Max. memory is 16.1GB. [2022-07-13 21:40:46,281 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 79.7MB. Free memory was 58.3MB in the beginning and 58.2MB in the end (delta: 28.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 21:40:46,281 INFO L158 Benchmark]: CACSL2BoogieTranslator took 432.96ms. Allocated memory is still 96.5MB. Free memory was 60.2MB in the beginning and 61.4MB in the end (delta: -1.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 21:40:46,281 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.16ms. Allocated memory is still 96.5MB. Free memory was 61.4MB in the beginning and 59.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 21:40:46,282 INFO L158 Benchmark]: Boogie Preprocessor took 28.05ms. Allocated memory is still 96.5MB. Free memory was 59.3MB in the beginning and 57.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 21:40:46,282 INFO L158 Benchmark]: RCFGBuilder took 359.37ms. Allocated memory is still 96.5MB. Free memory was 57.9MB in the beginning and 43.6MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-13 21:40:46,282 INFO L158 Benchmark]: TraceAbstraction took 15007.92ms. Allocated memory was 96.5MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 42.9MB in the beginning and 2.4GB in the end (delta: -2.4GB). Peak memory consumption was 950.9MB. Max. memory is 16.1GB. [2022-07-13 21:40:46,283 INFO L158 Benchmark]: Witness Printer took 79.90ms. Allocated memory is still 3.4GB. Free memory was 2.4GB in the beginning and 2.4GB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 21:40:46,285 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.19ms. Allocated memory is still 79.7MB. Free memory was 58.3MB in the beginning and 58.2MB in the end (delta: 28.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 432.96ms. Allocated memory is still 96.5MB. Free memory was 60.2MB in the beginning and 61.4MB in the end (delta: -1.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.16ms. Allocated memory is still 96.5MB. Free memory was 61.4MB in the beginning and 59.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.05ms. Allocated memory is still 96.5MB. Free memory was 59.3MB in the beginning and 57.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 359.37ms. Allocated memory is still 96.5MB. Free memory was 57.9MB in the beginning and 43.6MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 15007.92ms. Allocated memory was 96.5MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 42.9MB in the beginning and 2.4GB in the end (delta: -2.4GB). Peak memory consumption was 950.9MB. Max. memory is 16.1GB. * Witness Printer took 79.90ms. Allocated memory is still 3.4GB. Free memory was 2.4GB in the beginning and 2.4GB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 738]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L704] 0 int w=0, r=0, x, y; VAL [r=0, w=0, x=0, y=0] [L748] 0 pthread_t t1, t2, t3, t4; VAL [r=0, t1={6:0}, t2={7:0}, t3={8:0}, t4={5:0}, w=0, x=0, y=0] [L749] FCALL, FORK 0 pthread_create(&t1, 0, writer, 0) VAL [pthread_create(&t1, 0, writer, 0)=-3, r=0, t1={6:0}, t2={7:0}, t3={8:0}, t4={5:0}, w=0, x=0, y=0] [L750] FCALL, FORK 0 pthread_create(&t2, 0, reader, 0) VAL [pthread_create(&t2, 0, reader, 0)=-2, r=0, t1={6:0}, t2={7:0}, t3={8:0}, t4={5:0}, w=0, x=0, y=0] [L724] 2 int l; VAL [arg={0:0}, arg={0:0}, r=0, w=0, x=0, y=0] [L725] CALL 2 __VERIFIER_atomic_take_read_lock() [L710] CALL 2 assume_abort_if_not(w==0) [L3] COND FALSE 2 !(!cond) [L710] RET 2 assume_abort_if_not(w==0) [L711] 2 r = r+1 [L725] RET 2 __VERIFIER_atomic_take_read_lock() [L751] FCALL, FORK 0 pthread_create(&t3, 0, writer, 0) VAL [pthread_create(&t3, 0, writer, 0)=-1, r=1, t1={6:0}, t2={7:0}, t3={8:0}, t4={5:0}, w=0, x=0, y=0] [L752] FCALL, FORK 0 pthread_create(&t4, 0, reader, 0) VAL [pthread_create(&t4, 0, reader, 0)=0, r=1, t1={6:0}, t2={7:0}, t3={8:0}, t4={5:0}, w=0, x=0, y=0] [L727] 2 l = x VAL [arg={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L730] 2 y = l VAL [arg={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L733] 2 int ly = y; VAL [arg={0:0}, arg={0:0}, l=0, ly=0, r=1, w=0, x=0, y=0] [L736] 2 int lx = x; VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L738] COND FALSE 2 !(!(ly == lx)) VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L740] 2 l = r-1 VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L724] 4 int l; VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L725] CALL 4 __VERIFIER_atomic_take_read_lock() [L710] CALL 4 assume_abort_if_not(w==0) [L3] COND FALSE 4 !(!cond) [L710] RET 4 assume_abort_if_not(w==0) [L711] 4 r = r+1 [L725] RET 4 __VERIFIER_atomic_take_read_lock() [L743] 2 r = l VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=0, x=0, y=0] [L714] CALL 1 __VERIFIER_atomic_take_write_lock() [L706] CALL 1 assume_abort_if_not(w==0 && r==0) [L3] COND FALSE 1 !(!cond) [L706] RET 1 assume_abort_if_not(w==0 && r==0) [L707] 1 w = 1 [L714] RET 1 __VERIFIER_atomic_take_write_lock() [L727] 4 l = x VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L730] 4 y = l VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L733] 4 int ly = y; VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L716] 1 x = 3 VAL [arg={0:0}, arg={0:0}, r=0, w=1, x=3, y=0] [L736] 4 int lx = x; VAL [arg={0:0}, arg={0:0}, l=0, lx=3, ly=0, r=0, w=1, x=3, y=0] [L738] COND TRUE 4 !(ly == lx) VAL [arg={0:0}, arg={0:0}, l=0, lx=3, ly=0, r=0, w=1, x=3, y=0] [L738] 4 reach_error() VAL [arg={0:0}, arg={0:0}, l=0, lx=3, ly=0, r=0, w=1, x=3, y=0] - UnprovableResult [Line: 749]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 750]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 751]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 139 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.8s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 13.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 600 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 600 mSDsluCounter, 391 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 767 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1491 IncrementalHoareTripleChecker+Invalid, 1542 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 169 mSDtfsCounter, 1491 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5114occurred in iteration=6, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 535 NumberOfCodeBlocks, 535 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 462 ConstructedInterpolants, 0 QuantifiedInterpolants, 856 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-13 21:40:46,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE