./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 eb692b52 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-?-eb692b5 [2022-07-19 21:01:59,148 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 21:01:59,150 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 21:01:59,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 21:01:59,177 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 21:01:59,179 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 21:01:59,182 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 21:01:59,185 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 21:01:59,187 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 21:01:59,190 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 21:01:59,191 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 21:01:59,192 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 21:01:59,192 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 21:01:59,194 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 21:01:59,195 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 21:01:59,196 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 21:01:59,197 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 21:01:59,198 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 21:01:59,200 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 21:01:59,204 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 21:01:59,205 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 21:01:59,206 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 21:01:59,206 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 21:01:59,207 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 21:01:59,208 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 21:01:59,214 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 21:01:59,214 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 21:01:59,214 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 21:01:59,215 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 21:01:59,215 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 21:01:59,216 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 21:01:59,216 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 21:01:59,217 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 21:01:59,218 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 21:01:59,218 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 21:01:59,219 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 21:01:59,219 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 21:01:59,219 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 21:01:59,220 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 21:01:59,220 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 21:01:59,220 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 21:01:59,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 21:01:59,223 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 21:01:59,246 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 21:01:59,246 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 21:01:59,247 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 21:01:59,247 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 21:01:59,247 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 21:01:59,247 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 21:01:59,248 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 21:01:59,248 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 21:01:59,248 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 21:01:59,249 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 21:01:59,249 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 21:01:59,249 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 21:01:59,249 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 21:01:59,249 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 21:01:59,249 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 21:01:59,250 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 21:01:59,250 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 21:01:59,250 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 21:01:59,250 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 21:01:59,250 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 21:01:59,250 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 21:01:59,250 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 21:01:59,251 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 21:01:59,251 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 21:01:59,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 21:01:59,251 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 21:01:59,251 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 21:01:59,251 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 21:01:59,251 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 21:01:59,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 21:01:59,252 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 21:01:59,252 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 21:01:59,252 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 21:01:59,252 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-19 21:01:59,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 21:01:59,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 21:01:59,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 21:01:59,481 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 21:01:59,481 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 21:01:59,482 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-19 21:01:59,541 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e71f4b8cf/f7cae0aa8b974db6a1e61f1a285048f6/FLAG363e939aa [2022-07-19 21:01:59,929 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 21:01:59,929 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2022-07-19 21:01:59,947 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e71f4b8cf/f7cae0aa8b974db6a1e61f1a285048f6/FLAG363e939aa [2022-07-19 21:01:59,955 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e71f4b8cf/f7cae0aa8b974db6a1e61f1a285048f6 [2022-07-19 21:01:59,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 21:01:59,958 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 21:01:59,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 21:01:59,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 21:01:59,962 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 21:01:59,962 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:01:59" (1/1) ... [2022-07-19 21:01:59,963 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2362a8a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:01:59, skipping insertion in model container [2022-07-19 21:01:59,963 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:01:59" (1/1) ... [2022-07-19 21:01:59,968 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 21:02:00,004 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 21:02:00,154 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-07-19 21:02:00,262 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-19 21:02:00,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 21:02:00,280 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 21:02:00,296 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-07-19 21:02:00,315 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-19 21:02:00,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 21:02:00,346 INFO L208 MainTranslator]: Completed translation [2022-07-19 21:02:00,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:02:00 WrapperNode [2022-07-19 21:02:00,346 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 21:02:00,347 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 21:02:00,347 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 21:02:00,347 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 21:02:00,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:02:00" (1/1) ... [2022-07-19 21:02:00,366 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:02:00" (1/1) ... [2022-07-19 21:02:00,381 INFO L137 Inliner]: procedures = 174, calls = 51, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 119 [2022-07-19 21:02:00,383 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 21:02:00,384 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 21:02:00,386 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 21:02:00,386 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 21:02:00,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:02:00" (1/1) ... [2022-07-19 21:02:00,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:02:00" (1/1) ... [2022-07-19 21:02:00,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:02:00" (1/1) ... [2022-07-19 21:02:00,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:02:00" (1/1) ... [2022-07-19 21:02:00,399 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:02:00" (1/1) ... [2022-07-19 21:02:00,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:02:00" (1/1) ... [2022-07-19 21:02:00,402 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:02:00" (1/1) ... [2022-07-19 21:02:00,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 21:02:00,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 21:02:00,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 21:02:00,405 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 21:02:00,417 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:02:00" (1/1) ... [2022-07-19 21:02:00,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 21:02:00,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:02:00,437 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-19 21:02:00,450 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-19 21:02:00,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 21:02:00,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 21:02:00,464 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-19 21:02:00,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 21:02:00,468 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2022-07-19 21:02:00,468 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2022-07-19 21:02:00,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 21:02:00,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 21:02:00,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 21:02:00,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-19 21:02:00,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 21:02:00,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 21:02:00,469 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2022-07-19 21:02:00,469 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2022-07-19 21:02:00,470 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-19 21:02:00,568 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 21:02:00,569 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 21:02:00,720 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 21:02:00,741 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 21:02:00,741 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-19 21:02:00,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:02:00 BoogieIcfgContainer [2022-07-19 21:02:00,743 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 21:02:00,744 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 21:02:00,744 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 21:02:00,749 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 21:02:00,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 09:01:59" (1/3) ... [2022-07-19 21:02:00,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b0500f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:02:00, skipping insertion in model container [2022-07-19 21:02:00,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:02:00" (2/3) ... [2022-07-19 21:02:00,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b0500f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:02:00, skipping insertion in model container [2022-07-19 21:02:00,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:02:00" (3/3) ... [2022-07-19 21:02:00,752 INFO L111 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2022-07-19 21:02:00,755 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-19 21:02:00,764 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 21:02:00,765 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 21:02:00,765 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-19 21:02:00,825 INFO L135 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-07-19 21:02:00,850 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 125 places, 114 transitions, 260 flow [2022-07-19 21:02:00,908 INFO L129 PetriNetUnfolder]: 2/110 cut-off events. [2022-07-19 21:02:00,910 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-07-19 21:02:00,915 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-19 21:02:00,916 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 114 transitions, 260 flow [2022-07-19 21:02:00,919 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 96 transitions, 213 flow [2022-07-19 21:02:00,928 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 21:02:00,933 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@7a00970e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@f2d618e [2022-07-19 21:02:00,933 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-07-19 21:02:00,942 INFO L129 PetriNetUnfolder]: 1/58 cut-off events. [2022-07-19 21:02:00,942 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-19 21:02:00,943 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:02:00,943 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-19 21:02:00,944 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-19 21:02:00,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:02:00,947 INFO L85 PathProgramCache]: Analyzing trace with hash 2006515335, now seen corresponding path program 1 times [2022-07-19 21:02:00,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:02:00,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509622937] [2022-07-19 21:02:00,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:02:00,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:02:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:02:01,141 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-19 21:02:01,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:02:01,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509622937] [2022-07-19 21:02:01,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509622937] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:02:01,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:02:01,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 21:02:01,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486484592] [2022-07-19 21:02:01,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:02:01,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 21:02:01,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:02:01,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 21:02:01,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:02:01,172 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114 [2022-07-19 21:02:01,175 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-19 21:02:01,175 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:02:01,175 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114 [2022-07-19 21:02:01,176 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:02:02,086 INFO L129 PetriNetUnfolder]: 3525/7769 cut-off events. [2022-07-19 21:02:02,086 INFO L130 PetriNetUnfolder]: For 1654/1654 co-relation queries the response was YES. [2022-07-19 21:02:02,106 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-19 21:02:02,144 INFO L132 encePairwiseOnDemand]: 102/114 looper letters, 116 selfloop transitions, 32 changer transitions 0/214 dead transitions. [2022-07-19 21:02:02,144 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 214 transitions, 823 flow [2022-07-19 21:02:02,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 21:02:02,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-07-19 21:02:02,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1160 transitions. [2022-07-19 21:02:02,160 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.847953216374269 [2022-07-19 21:02:02,161 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1160 transitions. [2022-07-19 21:02:02,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1160 transitions. [2022-07-19 21:02:02,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:02:02,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1160 transitions. [2022-07-19 21:02:02,171 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-19 21:02:02,178 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-19 21:02:02,179 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-19 21:02:02,181 INFO L186 Difference]: Start difference. First operand has 107 places, 96 transitions, 213 flow. Second operand 12 states and 1160 transitions. [2022-07-19 21:02:02,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 214 transitions, 823 flow [2022-07-19 21:02:02,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 214 transitions, 764 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-07-19 21:02:02,218 INFO L242 Difference]: Finished difference. Result has 119 places, 129 transitions, 416 flow [2022-07-19 21:02:02,220 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-19 21:02:02,227 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 12 predicate places. [2022-07-19 21:02:02,228 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 129 transitions, 416 flow [2022-07-19 21:02:02,228 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-19 21:02:02,228 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:02:02,229 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-19 21:02:02,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 21:02:02,230 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-19 21:02:02,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:02:02,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1738116757, now seen corresponding path program 1 times [2022-07-19 21:02:02,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:02:02,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542113842] [2022-07-19 21:02:02,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:02:02,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:02:02,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:02:02,329 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-19 21:02:02,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:02:02,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542113842] [2022-07-19 21:02:02,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542113842] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:02:02,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:02:02,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 21:02:02,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369257439] [2022-07-19 21:02:02,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:02:02,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 21:02:02,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:02:02,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 21:02:02,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 21:02:02,333 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 114 [2022-07-19 21:02:02,333 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-19 21:02:02,334 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:02:02,334 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 114 [2022-07-19 21:02:02,334 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:02:02,533 INFO L129 PetriNetUnfolder]: 398/2267 cut-off events. [2022-07-19 21:02:02,534 INFO L130 PetriNetUnfolder]: For 379/391 co-relation queries the response was YES. [2022-07-19 21:02:02,542 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-19 21:02:02,550 INFO L132 encePairwiseOnDemand]: 108/114 looper letters, 15 selfloop transitions, 4 changer transitions 0/134 dead transitions. [2022-07-19 21:02:02,550 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 134 transitions, 470 flow [2022-07-19 21:02:02,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 21:02:02,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-19 21:02:02,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2022-07-19 21:02:02,552 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9181286549707602 [2022-07-19 21:02:02,552 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2022-07-19 21:02:02,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2022-07-19 21:02:02,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:02:02,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2022-07-19 21:02:02,554 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-19 21:02:02,554 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-19 21:02:02,555 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-19 21:02:02,555 INFO L186 Difference]: Start difference. First operand has 119 places, 129 transitions, 416 flow. Second operand 3 states and 314 transitions. [2022-07-19 21:02:02,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 134 transitions, 470 flow [2022-07-19 21:02:02,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 134 transitions, 470 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-19 21:02:02,566 INFO L242 Difference]: Finished difference. Result has 122 places, 129 transitions, 432 flow [2022-07-19 21:02:02,567 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-19 21:02:02,567 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 15 predicate places. [2022-07-19 21:02:02,568 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 129 transitions, 432 flow [2022-07-19 21:02:02,568 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-19 21:02:02,569 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:02:02,569 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-19 21:02:02,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 21:02:02,569 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-19 21:02:02,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:02:02,570 INFO L85 PathProgramCache]: Analyzing trace with hash 195211785, now seen corresponding path program 2 times [2022-07-19 21:02:02,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:02:02,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108163838] [2022-07-19 21:02:02,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:02:02,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:02:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:02:02,658 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-19 21:02:02,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:02:02,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108163838] [2022-07-19 21:02:02,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108163838] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:02:02,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:02:02,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 21:02:02,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996235527] [2022-07-19 21:02:02,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:02:02,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 21:02:02,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:02:02,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 21:02:02,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 21:02:02,663 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114 [2022-07-19 21:02:02,664 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-19 21:02:02,664 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:02:02,664 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114 [2022-07-19 21:02:02,664 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:02:03,132 INFO L129 PetriNetUnfolder]: 1590/4818 cut-off events. [2022-07-19 21:02:03,133 INFO L130 PetriNetUnfolder]: For 2362/2464 co-relation queries the response was YES. [2022-07-19 21:02:03,149 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-19 21:02:03,164 INFO L132 encePairwiseOnDemand]: 105/114 looper letters, 45 selfloop transitions, 19 changer transitions 4/175 dead transitions. [2022-07-19 21:02:03,164 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 175 transitions, 737 flow [2022-07-19 21:02:03,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 21:02:03,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-19 21:02:03,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 518 transitions. [2022-07-19 21:02:03,166 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9087719298245615 [2022-07-19 21:02:03,167 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 518 transitions. [2022-07-19 21:02:03,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 518 transitions. [2022-07-19 21:02:03,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:02:03,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 518 transitions. [2022-07-19 21:02:03,169 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-19 21:02:03,170 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-19 21:02:03,170 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-19 21:02:03,171 INFO L186 Difference]: Start difference. First operand has 122 places, 129 transitions, 432 flow. Second operand 5 states and 518 transitions. [2022-07-19 21:02:03,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 175 transitions, 737 flow [2022-07-19 21:02:03,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 175 transitions, 717 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-19 21:02:03,190 INFO L242 Difference]: Finished difference. Result has 124 places, 143 transitions, 510 flow [2022-07-19 21:02:03,190 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-19 21:02:03,192 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 17 predicate places. [2022-07-19 21:02:03,192 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 143 transitions, 510 flow [2022-07-19 21:02:03,192 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-19 21:02:03,192 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:02:03,193 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-19 21:02:03,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 21:02:03,193 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-19 21:02:03,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:02:03,194 INFO L85 PathProgramCache]: Analyzing trace with hash 579299824, now seen corresponding path program 1 times [2022-07-19 21:02:03,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:02:03,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101260350] [2022-07-19 21:02:03,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:02:03,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:02:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:02:03,257 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-19 21:02:03,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:02:03,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101260350] [2022-07-19 21:02:03,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101260350] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:02:03,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:02:03,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 21:02:03,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089179429] [2022-07-19 21:02:03,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:02:03,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 21:02:03,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:02:03,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 21:02:03,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:02:03,260 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114 [2022-07-19 21:02:03,261 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-19 21:02:03,261 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:02:03,261 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114 [2022-07-19 21:02:03,261 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:02:04,816 INFO L129 PetriNetUnfolder]: 8131/17870 cut-off events. [2022-07-19 21:02:04,817 INFO L130 PetriNetUnfolder]: For 15561/15640 co-relation queries the response was YES. [2022-07-19 21:02:04,873 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-19 21:02:04,939 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 207 selfloop transitions, 134 changer transitions 25/442 dead transitions. [2022-07-19 21:02:04,940 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 442 transitions, 2686 flow [2022-07-19 21:02:04,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 21:02:04,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-07-19 21:02:04,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1151 transitions. [2022-07-19 21:02:04,942 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.841374269005848 [2022-07-19 21:02:04,943 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1151 transitions. [2022-07-19 21:02:04,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1151 transitions. [2022-07-19 21:02:04,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:02:04,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1151 transitions. [2022-07-19 21:02:04,945 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-19 21:02:04,947 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-19 21:02:04,948 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-19 21:02:04,948 INFO L186 Difference]: Start difference. First operand has 124 places, 143 transitions, 510 flow. Second operand 12 states and 1151 transitions. [2022-07-19 21:02:04,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 442 transitions, 2686 flow [2022-07-19 21:02:05,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 442 transitions, 2680 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-07-19 21:02:05,117 INFO L242 Difference]: Finished difference. Result has 143 places, 298 transitions, 1900 flow [2022-07-19 21:02:05,117 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-19 21:02:05,123 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 36 predicate places. [2022-07-19 21:02:05,123 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 298 transitions, 1900 flow [2022-07-19 21:02:05,124 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-19 21:02:05,124 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:02:05,124 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-19 21:02:05,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 21:02:05,124 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-19 21:02:05,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:02:05,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1097766141, now seen corresponding path program 1 times [2022-07-19 21:02:05,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:02:05,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033542914] [2022-07-19 21:02:05,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:02:05,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:02:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:02:05,191 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-19 21:02:05,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:02:05,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033542914] [2022-07-19 21:02:05,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033542914] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:02:05,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:02:05,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 21:02:05,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879201820] [2022-07-19 21:02:05,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:02:05,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 21:02:05,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:02:05,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 21:02:05,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:02:05,195 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114 [2022-07-19 21:02:05,196 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-19 21:02:05,196 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:02:05,196 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114 [2022-07-19 21:02:05,196 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:02:07,238 INFO L129 PetriNetUnfolder]: 9006/19880 cut-off events. [2022-07-19 21:02:07,238 INFO L130 PetriNetUnfolder]: For 29259/29357 co-relation queries the response was YES. [2022-07-19 21:02:07,304 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-19 21:02:07,368 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 237 selfloop transitions, 206 changer transitions 5/524 dead transitions. [2022-07-19 21:02:07,368 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 524 transitions, 4189 flow [2022-07-19 21:02:07,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 21:02:07,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-19 21:02:07,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1235 transitions. [2022-07-19 21:02:07,371 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2022-07-19 21:02:07,371 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1235 transitions. [2022-07-19 21:02:07,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1235 transitions. [2022-07-19 21:02:07,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:02:07,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1235 transitions. [2022-07-19 21:02:07,374 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-19 21:02:07,375 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-19 21:02:07,376 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-19 21:02:07,376 INFO L186 Difference]: Start difference. First operand has 143 places, 298 transitions, 1900 flow. Second operand 13 states and 1235 transitions. [2022-07-19 21:02:07,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 524 transitions, 4189 flow [2022-07-19 21:02:07,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 524 transitions, 4189 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-19 21:02:07,864 INFO L242 Difference]: Finished difference. Result has 163 places, 386 transitions, 3338 flow [2022-07-19 21:02:07,864 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-19 21:02:07,865 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 56 predicate places. [2022-07-19 21:02:07,865 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 386 transitions, 3338 flow [2022-07-19 21:02:07,865 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-19 21:02:07,865 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:02:07,866 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-19 21:02:07,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 21:02:07,866 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-19 21:02:07,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:02:07,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1042275993, now seen corresponding path program 1 times [2022-07-19 21:02:07,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:02:07,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637637787] [2022-07-19 21:02:07,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:02:07,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:02:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:02:07,900 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-19 21:02:07,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:02:07,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637637787] [2022-07-19 21:02:07,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637637787] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:02:07,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:02:07,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 21:02:07,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068429018] [2022-07-19 21:02:07,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:02:07,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 21:02:07,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:02:07,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 21:02:07,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:02:07,903 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114 [2022-07-19 21:02:07,903 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-19 21:02:07,903 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:02:07,903 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114 [2022-07-19 21:02:07,904 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:02:10,472 INFO L129 PetriNetUnfolder]: 9876/21673 cut-off events. [2022-07-19 21:02:10,473 INFO L130 PetriNetUnfolder]: For 52197/52248 co-relation queries the response was YES. [2022-07-19 21:02:10,551 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-19 21:02:10,611 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 295 selfloop transitions, 249 changer transitions 8/643 dead transitions. [2022-07-19 21:02:10,612 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 643 transitions, 6329 flow [2022-07-19 21:02:10,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 21:02:10,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-19 21:02:10,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1239 transitions. [2022-07-19 21:02:10,614 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8360323886639676 [2022-07-19 21:02:10,614 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1239 transitions. [2022-07-19 21:02:10,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1239 transitions. [2022-07-19 21:02:10,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:02:10,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1239 transitions. [2022-07-19 21:02:10,617 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-19 21:02:10,619 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-19 21:02:10,619 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-19 21:02:10,619 INFO L186 Difference]: Start difference. First operand has 163 places, 386 transitions, 3338 flow. Second operand 13 states and 1239 transitions. [2022-07-19 21:02:10,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 643 transitions, 6329 flow [2022-07-19 21:02:11,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 643 transitions, 6261 flow, removed 18 selfloop flow, removed 1 redundant places. [2022-07-19 21:02:11,453 INFO L242 Difference]: Finished difference. Result has 182 places, 484 transitions, 5114 flow [2022-07-19 21:02:11,453 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-19 21:02:11,454 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 75 predicate places. [2022-07-19 21:02:11,454 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 484 transitions, 5114 flow [2022-07-19 21:02:11,454 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-19 21:02:11,455 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:02:11,455 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-19 21:02:11,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 21:02:11,455 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-19 21:02:11,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:02:11,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1127280812, now seen corresponding path program 1 times [2022-07-19 21:02:11,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:02:11,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739322228] [2022-07-19 21:02:11,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:02:11,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:02:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:02:11,501 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-19 21:02:11,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:02:11,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739322228] [2022-07-19 21:02:11,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739322228] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:02:11,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:02:11,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 21:02:11,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499103769] [2022-07-19 21:02:11,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:02:11,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 21:02:11,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:02:11,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 21:02:11,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 21:02:11,502 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 114 [2022-07-19 21:02:11,503 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-19 21:02:11,503 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:02:11,503 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 114 [2022-07-19 21:02:11,503 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:02:11,973 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-19 21:02:11,973 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-07-19 21:02:11,973 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-19 21:02:11,973 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-19 21:02:11,974 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-19 21:02:11,994 INFO L129 PetriNetUnfolder]: 947/3465 cut-off events. [2022-07-19 21:02:11,994 INFO L130 PetriNetUnfolder]: For 8687/8759 co-relation queries the response was YES. [2022-07-19 21:02:12,010 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-19 21:02:12,014 INFO L132 encePairwiseOnDemand]: 107/114 looper letters, 40 selfloop transitions, 11 changer transitions 44/281 dead transitions. [2022-07-19 21:02:12,014 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 281 transitions, 2262 flow [2022-07-19 21:02:12,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 21:02:12,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-19 21:02:12,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 522 transitions. [2022-07-19 21:02:12,015 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9157894736842105 [2022-07-19 21:02:12,016 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 522 transitions. [2022-07-19 21:02:12,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 522 transitions. [2022-07-19 21:02:12,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:02:12,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 522 transitions. [2022-07-19 21:02:12,018 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-19 21:02:12,018 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-19 21:02:12,019 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-19 21:02:12,019 INFO L186 Difference]: Start difference. First operand has 182 places, 484 transitions, 5114 flow. Second operand 5 states and 522 transitions. [2022-07-19 21:02:12,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 281 transitions, 2262 flow [2022-07-19 21:02:12,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 281 transitions, 2219 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-07-19 21:02:12,070 INFO L242 Difference]: Finished difference. Result has 185 places, 226 transitions, 1692 flow [2022-07-19 21:02:12,070 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-19 21:02:12,071 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 78 predicate places. [2022-07-19 21:02:12,071 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 226 transitions, 1692 flow [2022-07-19 21:02:12,071 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-19 21:02:12,071 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:02:12,071 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-19 21:02:12,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 21:02:12,072 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-19 21:02:12,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:02:12,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1072455534, now seen corresponding path program 1 times [2022-07-19 21:02:12,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:02:12,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11360190] [2022-07-19 21:02:12,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:02:12,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:02:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:02:12,119 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-19 21:02:12,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:02:12,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11360190] [2022-07-19 21:02:12,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11360190] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:02:12,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:02:12,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 21:02:12,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102980883] [2022-07-19 21:02:12,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:02:12,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 21:02:12,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:02:12,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 21:02:12,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:02:12,121 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114 [2022-07-19 21:02:12,122 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-19 21:02:12,122 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:02:12,122 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114 [2022-07-19 21:02:12,122 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:02:12,475 INFO L129 PetriNetUnfolder]: 879/3214 cut-off events. [2022-07-19 21:02:12,475 INFO L130 PetriNetUnfolder]: For 8924/8988 co-relation queries the response was YES. [2022-07-19 21:02:12,489 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-19 21:02:12,494 INFO L132 encePairwiseOnDemand]: 106/114 looper letters, 55 selfloop transitions, 17 changer transitions 37/283 dead transitions. [2022-07-19 21:02:12,494 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 283 transitions, 2246 flow [2022-07-19 21:02:12,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 21:02:12,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-19 21:02:12,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 803 transitions. [2022-07-19 21:02:12,499 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8804824561403509 [2022-07-19 21:02:12,499 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 803 transitions. [2022-07-19 21:02:12,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 803 transitions. [2022-07-19 21:02:12,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:02:12,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 803 transitions. [2022-07-19 21:02:12,501 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-19 21:02:12,503 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-19 21:02:12,504 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-19 21:02:12,504 INFO L186 Difference]: Start difference. First operand has 185 places, 226 transitions, 1692 flow. Second operand 8 states and 803 transitions. [2022-07-19 21:02:12,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 283 transitions, 2246 flow [2022-07-19 21:02:12,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 283 transitions, 2191 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-07-19 21:02:12,557 INFO L242 Difference]: Finished difference. Result has 189 places, 226 transitions, 1707 flow [2022-07-19 21:02:12,557 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-19 21:02:12,558 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 82 predicate places. [2022-07-19 21:02:12,558 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 226 transitions, 1707 flow [2022-07-19 21:02:12,558 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-19 21:02:12,558 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:02:12,558 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-19 21:02:12,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 21:02:12,559 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-19 21:02:12,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:02:12,559 INFO L85 PathProgramCache]: Analyzing trace with hash -143796270, now seen corresponding path program 2 times [2022-07-19 21:02:12,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:02:12,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602081035] [2022-07-19 21:02:12,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:02:12,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:02:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:02:12,615 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-19 21:02:12,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:02:12,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602081035] [2022-07-19 21:02:12,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602081035] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:02:12,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:02:12,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 21:02:12,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336692342] [2022-07-19 21:02:12,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:02:12,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 21:02:12,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:02:12,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 21:02:12,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:02:12,618 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114 [2022-07-19 21:02:12,618 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-19 21:02:12,618 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:02:12,618 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114 [2022-07-19 21:02:12,619 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:02:12,881 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-19 21:02:12,881 INFO L384 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-07-19 21:02:12,881 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-19 21:02:12,881 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-19 21:02:12,881 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-19 21:02:12,905 INFO L129 PetriNetUnfolder]: 672/2660 cut-off events. [2022-07-19 21:02:12,905 INFO L130 PetriNetUnfolder]: For 7007/7077 co-relation queries the response was YES. [2022-07-19 21:02:12,917 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-19 21:02:12,921 INFO L132 encePairwiseOnDemand]: 106/114 looper letters, 51 selfloop transitions, 14 changer transitions 23/244 dead transitions. [2022-07-19 21:02:12,921 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 244 transitions, 1889 flow [2022-07-19 21:02:12,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 21:02:12,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-19 21:02:12,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 699 transitions. [2022-07-19 21:02:12,922 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8759398496240601 [2022-07-19 21:02:12,922 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 699 transitions. [2022-07-19 21:02:12,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 699 transitions. [2022-07-19 21:02:12,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:02:12,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 699 transitions. [2022-07-19 21:02:12,924 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-19 21:02:12,925 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-19 21:02:12,925 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-19 21:02:12,925 INFO L186 Difference]: Start difference. First operand has 189 places, 226 transitions, 1707 flow. Second operand 7 states and 699 transitions. [2022-07-19 21:02:12,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 244 transitions, 1889 flow [2022-07-19 21:02:12,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 244 transitions, 1830 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-07-19 21:02:12,961 INFO L242 Difference]: Finished difference. Result has 192 places, 203 transitions, 1418 flow [2022-07-19 21:02:12,961 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-19 21:02:12,962 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 85 predicate places. [2022-07-19 21:02:12,962 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 203 transitions, 1418 flow [2022-07-19 21:02:12,962 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-19 21:02:12,962 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:02:12,963 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-19 21:02:12,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 21:02:12,963 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-19 21:02:12,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:02:12,963 INFO L85 PathProgramCache]: Analyzing trace with hash 571210246, now seen corresponding path program 3 times [2022-07-19 21:02:12,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:02:12,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477204270] [2022-07-19 21:02:12,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:02:12,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:02:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 21:02:12,976 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 21:02:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 21:02:13,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 21:02:13,002 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 21:02:13,003 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-07-19 21:02:13,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-07-19 21:02:13,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-07-19 21:02:13,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-07-19 21:02:13,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-07-19 21:02:13,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-07-19 21:02:13,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-07-19 21:02:13,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 21:02:13,006 INFO L356 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1] [2022-07-19 21:02:13,010 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-19 21:02:13,010 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 21:02:13,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 09:02:13 BasicIcfg [2022-07-19 21:02:13,088 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 21:02:13,089 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 21:02:13,089 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 21:02:13,089 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 21:02:13,089 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:02:00" (3/4) ... [2022-07-19 21:02:13,090 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-19 21:02:13,135 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 21:02:13,135 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 21:02:13,135 INFO L158 Benchmark]: Toolchain (without parser) took 13177.47ms. Allocated memory was 102.8MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 63.5MB in the beginning and 2.6GB in the end (delta: -2.6GB). Peak memory consumption was 540.2MB. Max. memory is 16.1GB. [2022-07-19 21:02:13,136 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 102.8MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 21:02:13,136 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.88ms. Allocated memory is still 102.8MB. Free memory was 63.3MB in the beginning and 67.0MB in the end (delta: -3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 21:02:13,136 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.63ms. Allocated memory is still 102.8MB. Free memory was 67.0MB in the beginning and 64.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 21:02:13,137 INFO L158 Benchmark]: Boogie Preprocessor took 20.19ms. Allocated memory is still 102.8MB. Free memory was 64.6MB in the beginning and 63.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 21:02:13,137 INFO L158 Benchmark]: RCFGBuilder took 338.20ms. Allocated memory is still 102.8MB. Free memory was 63.4MB in the beginning and 48.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-19 21:02:13,137 INFO L158 Benchmark]: TraceAbstraction took 12344.16ms. Allocated memory was 102.8MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 48.1MB in the beginning and 2.6GB in the end (delta: -2.6GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2022-07-19 21:02:13,137 INFO L158 Benchmark]: Witness Printer took 46.54ms. Allocated memory is still 3.2GB. Free memory was 2.6GB in the beginning and 2.6GB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-19 21:02:13,138 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.16ms. Allocated memory is still 102.8MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 386.88ms. Allocated memory is still 102.8MB. Free memory was 63.3MB in the beginning and 67.0MB in the end (delta: -3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.63ms. Allocated memory is still 102.8MB. Free memory was 67.0MB in the beginning and 64.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.19ms. Allocated memory is still 102.8MB. Free memory was 64.6MB in the beginning and 63.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 338.20ms. Allocated memory is still 102.8MB. Free memory was 63.4MB in the beginning and 48.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 12344.16ms. Allocated memory was 102.8MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 48.1MB in the beginning and 2.6GB in the end (delta: -2.6GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 46.54ms. Allocated memory is still 3.2GB. Free memory was 2.6GB in the beginning and 2.6GB 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: 12.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 600 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 600 mSDsluCounter, 391 SdHoareTripleChecker+Invalid, 0.7s 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.1s SatisfiabilityAnalysisTime, 0.4s 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-19 21:02:13,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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