./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-atomic/read_write_lock-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-atomic/read_write_lock-1.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 8fab2e995569cc819974baee7d52d8d4bdabd2a2896c83fb3b8d07b44f394c5b --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 21:40:27,980 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 21:40:27,982 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 21:40:28,027 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 21:40:28,028 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 21:40:28,030 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 21:40:28,031 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 21:40:28,034 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 21:40:28,035 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 21:40:28,041 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 21:40:28,042 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 21:40:28,044 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 21:40:28,044 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 21:40:28,046 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 21:40:28,047 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 21:40:28,051 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 21:40:28,052 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 21:40:28,053 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 21:40:28,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 21:40:28,058 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 21:40:28,060 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 21:40:28,061 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 21:40:28,062 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 21:40:28,063 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 21:40:28,064 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 21:40:28,069 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 21:40:28,069 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 21:40:28,069 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 21:40:28,070 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 21:40:28,071 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 21:40:28,072 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 21:40:28,072 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 21:40:28,074 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 21:40:28,074 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 21:40:28,075 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 21:40:28,075 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 21:40:28,076 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 21:40:28,076 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 21:40:28,076 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 21:40:28,077 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 21:40:28,078 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 21:40:28,079 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 21:40:28,080 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 21:40:28,108 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 21:40:28,109 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 21:40:28,109 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 21:40:28,109 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 21:40:28,110 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 21:40:28,110 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 21:40:28,110 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 21:40:28,111 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 21:40:28,111 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 21:40:28,112 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 21:40:28,112 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 21:40:28,112 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 21:40:28,112 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 21:40:28,112 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 21:40:28,113 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 21:40:28,113 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 21:40:28,113 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 21:40:28,113 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 21:40:28,113 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 21:40:28,114 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 21:40:28,114 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 21:40:28,115 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 21:40:28,115 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 21:40:28,115 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 21:40:28,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 21:40:28,116 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 21:40:28,116 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 21:40:28,116 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 21:40:28,116 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 21:40:28,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 21:40:28,117 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 21:40:28,117 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 21:40:28,117 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 21:40:28,117 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 -> 8fab2e995569cc819974baee7d52d8d4bdabd2a2896c83fb3b8d07b44f394c5b [2022-07-13 21:40:28,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 21:40:28,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 21:40:28,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 21:40:28,386 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 21:40:28,387 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 21:40:28,388 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/read_write_lock-1.i [2022-07-13 21:40:28,451 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/030f032b8/323929daeb93405f93311aa48b36707d/FLAG49587a205 [2022-07-13 21:40:28,962 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 21:40:28,962 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-1.i [2022-07-13 21:40:28,977 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/030f032b8/323929daeb93405f93311aa48b36707d/FLAG49587a205 [2022-07-13 21:40:29,435 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/030f032b8/323929daeb93405f93311aa48b36707d [2022-07-13 21:40:29,437 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 21:40:29,438 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 21:40:29,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 21:40:29,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 21:40:29,451 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 21:40:29,451 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 09:40:29" (1/1) ... [2022-07-13 21:40:29,452 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20e33eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:40:29, skipping insertion in model container [2022-07-13 21:40:29,452 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 09:40:29" (1/1) ... [2022-07-13 21:40:29,458 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 21:40:29,490 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 21:40:29,661 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-07-13 21:40:29,798 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-1.i[31246,31259] [2022-07-13 21:40:29,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 21:40:29,826 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 21:40:29,845 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-07-13 21:40:29,865 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-1.i[31246,31259] [2022-07-13 21:40:29,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 21:40:29,903 INFO L208 MainTranslator]: Completed translation [2022-07-13 21:40:29,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:40:29 WrapperNode [2022-07-13 21:40:29,904 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 21:40:29,905 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 21:40:29,905 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 21:40:29,905 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 21:40:29,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:40:29" (1/1) ... [2022-07-13 21:40:29,938 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:40:29" (1/1) ... [2022-07-13 21:40:29,966 INFO L137 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 114 [2022-07-13 21:40:29,967 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 21:40:29,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 21:40:29,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 21:40:29,969 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 21:40:29,976 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:40:29" (1/1) ... [2022-07-13 21:40:29,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:40:29" (1/1) ... [2022-07-13 21:40:29,994 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:40:29" (1/1) ... [2022-07-13 21:40:29,994 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:40:29" (1/1) ... [2022-07-13 21:40:29,998 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:40:29" (1/1) ... [2022-07-13 21:40:30,007 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:40:29" (1/1) ... [2022-07-13 21:40:30,009 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:40:29" (1/1) ... [2022-07-13 21:40:30,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 21:40:30,019 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 21:40:30,019 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 21:40:30,019 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 21:40:30,021 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:40:29" (1/1) ... [2022-07-13 21:40:30,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 21:40:30,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:40:30,057 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 21:40:30,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 21:40:30,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 21:40:30,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 21:40:30,093 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-13 21:40:30,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 21:40:30,094 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2022-07-13 21:40:30,095 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2022-07-13 21:40:30,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 21:40:30,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 21:40:30,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 21:40:30,095 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-13 21:40:30,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 21:40:30,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 21:40:30,096 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2022-07-13 21:40:30,096 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2022-07-13 21:40:30,097 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-13 21:40:30,193 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 21:40:30,194 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 21:40:30,361 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 21:40:30,386 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 21:40:30,386 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-13 21:40:30,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:40:30 BoogieIcfgContainer [2022-07-13 21:40:30,388 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 21:40:30,390 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 21:40:30,390 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 21:40:30,395 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 21:40:30,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 09:40:29" (1/3) ... [2022-07-13 21:40:30,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2165d9db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 09:40:30, skipping insertion in model container [2022-07-13 21:40:30,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:40:29" (2/3) ... [2022-07-13 21:40:30,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2165d9db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 09:40:30, skipping insertion in model container [2022-07-13 21:40:30,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:40:30" (3/3) ... [2022-07-13 21:40:30,398 INFO L111 eAbstractionObserver]: Analyzing ICFG read_write_lock-1.i [2022-07-13 21:40:30,403 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-13 21:40:30,410 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 21:40:30,411 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 21:40:30,411 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-13 21:40:30,474 INFO L135 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-07-13 21:40:30,504 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 256 flow [2022-07-13 21:40:30,540 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2022-07-13 21:40:30,540 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-07-13 21:40:30,545 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 108 events. 2/108 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-07-13 21:40:30,545 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 112 transitions, 256 flow [2022-07-13 21:40:30,549 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 94 transitions, 209 flow [2022-07-13 21:40:30,557 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 21:40:30,562 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@7ad5cacd, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1ee91f1 [2022-07-13 21:40:30,563 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-07-13 21:40:30,576 INFO L129 PetriNetUnfolder]: 1/59 cut-off events. [2022-07-13 21:40:30,579 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-13 21:40:30,579 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:40:30,580 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:40:30,580 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:40:30,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:40:30,585 INFO L85 PathProgramCache]: Analyzing trace with hash 764683200, now seen corresponding path program 1 times [2022-07-13 21:40:30,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:40:30,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421628050] [2022-07-13 21:40:30,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:40:30,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:40:30,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:40:30,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:40:30,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:40:30,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421628050] [2022-07-13 21:40:30,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421628050] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:40:30,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:40:30,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:40:30,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200606100] [2022-07-13 21:40:30,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:40:30,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:40:30,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:40:30,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:40:30,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:40:30,942 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 112 [2022-07-13 21:40:30,947 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 94 transitions, 209 flow. Second operand has 6 states, 6 states have (on average 82.83333333333333) internal successors, (497), 6 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:30,947 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:40:30,947 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 112 [2022-07-13 21:40:30,949 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:40:31,967 INFO L129 PetriNetUnfolder]: 3826/7989 cut-off events. [2022-07-13 21:40:31,968 INFO L130 PetriNetUnfolder]: For 1855/1855 co-relation queries the response was YES. [2022-07-13 21:40:31,986 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14639 conditions, 7989 events. 3826/7989 cut-off events. For 1855/1855 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 71212 event pairs, 1181 based on Foata normal form. 418/8051 useless extension candidates. Maximal degree in co-relation 13913. Up to 2013 conditions per place. [2022-07-13 21:40:32,020 INFO L132 encePairwiseOnDemand]: 101/112 looper letters, 109 selfloop transitions, 24 changer transitions 4/201 dead transitions. [2022-07-13 21:40:32,020 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 201 transitions, 769 flow [2022-07-13 21:40:32,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 21:40:32,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-13 21:40:32,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 961 transitions. [2022-07-13 21:40:32,036 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8580357142857142 [2022-07-13 21:40:32,036 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 961 transitions. [2022-07-13 21:40:32,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 961 transitions. [2022-07-13 21:40:32,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:40:32,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 961 transitions. [2022-07-13 21:40:32,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.1) internal successors, (961), 10 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:32,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:32,058 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:32,059 INFO L186 Difference]: Start difference. First operand has 105 places, 94 transitions, 209 flow. Second operand 10 states and 961 transitions. [2022-07-13 21:40:32,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 201 transitions, 769 flow [2022-07-13 21:40:32,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 201 transitions, 713 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-07-13 21:40:32,081 INFO L242 Difference]: Finished difference. Result has 115 places, 117 transitions, 367 flow [2022-07-13 21:40:32,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=367, PETRI_PLACES=115, PETRI_TRANSITIONS=117} [2022-07-13 21:40:32,087 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 10 predicate places. [2022-07-13 21:40:32,087 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 117 transitions, 367 flow [2022-07-13 21:40:32,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 82.83333333333333) internal successors, (497), 6 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:32,087 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:40:32,088 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:40:32,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 21:40:32,089 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:40:32,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:40:32,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1416784543, now seen corresponding path program 1 times [2022-07-13 21:40:32,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:40:32,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919405955] [2022-07-13 21:40:32,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:40:32,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:40:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:40:32,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:40:32,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:40:32,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919405955] [2022-07-13 21:40:32,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919405955] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:40:32,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:40:32,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 21:40:32,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863264457] [2022-07-13 21:40:32,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:40:32,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:40:32,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:40:32,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:40:32,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 21:40:32,174 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 112 [2022-07-13 21:40:32,175 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 117 transitions, 367 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:32,175 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:40:32,175 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 112 [2022-07-13 21:40:32,176 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:40:32,410 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([249] L739-2-->L740: Formula: (= v_~r~0_17 (+ (- 1) v_~r~0_18)) InVars {~r~0=v_~r~0_18} OutVars{~r~0=v_~r~0_17} AuxVars[] AssignedVars[~r~0][62], [60#L748-4true, 44#writerENTRYtrue, 102#L740true, 131#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 71#L740true, 153#true, Black: 139#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), 116#L721true, Black: 141#(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) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 135#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 128#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 133#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 126#true, readerThread1of1ForFork3InUse]) [2022-07-13 21:40:32,411 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2022-07-13 21:40:32,411 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-07-13 21:40:32,411 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-07-13 21:40:32,411 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-07-13 21:40:32,440 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([249] L739-2-->L740: Formula: (= v_~r~0_17 (+ (- 1) v_~r~0_18)) InVars {~r~0=v_~r~0_18} OutVars{~r~0=v_~r~0_17} AuxVars[] AssignedVars[~r~0][63], [60#L748-4true, 131#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 102#L740true, 71#L740true, 155#(= ~w~0 1), Black: 139#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), 116#L721true, Black: 141#(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) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 135#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 128#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 133#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 126#true, readerThread1of1ForFork3InUse, 21#L717-1true]) [2022-07-13 21:40:32,440 INFO L384 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-07-13 21:40:32,440 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-07-13 21:40:32,440 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-07-13 21:40:32,440 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-07-13 21:40:32,453 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([249] L739-2-->L740: Formula: (= v_~r~0_17 (+ (- 1) v_~r~0_18)) InVars {~r~0=v_~r~0_18} OutVars{~r~0=v_~r~0_17} AuxVars[] AssignedVars[~r~0][62], [60#L748-4true, 102#L740true, 131#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 71#L740true, 153#true, 94#L721true, Black: 139#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), 116#L721true, Black: 141#(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) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 135#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 128#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 133#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 126#true, readerThread1of1ForFork3InUse]) [2022-07-13 21:40:32,453 INFO L384 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-07-13 21:40:32,453 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-07-13 21:40:32,453 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-07-13 21:40:32,454 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-07-13 21:40:32,480 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([249] L739-2-->L740: Formula: (= v_~r~0_17 (+ (- 1) v_~r~0_18)) InVars {~r~0=v_~r~0_18} OutVars{~r~0=v_~r~0_17} AuxVars[] AssignedVars[~r~0][62], [107#L749-2true, 131#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 102#L740true, 71#L740true, 153#true, Black: 139#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), 116#L721true, Black: 141#(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) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 135#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 128#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 133#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 126#true, readerThread1of1ForFork3InUse]) [2022-07-13 21:40:32,480 INFO L384 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-07-13 21:40:32,480 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-13 21:40:32,480 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-13 21:40:32,481 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-13 21:40:32,490 INFO L129 PetriNetUnfolder]: 890/2859 cut-off events. [2022-07-13 21:40:32,490 INFO L130 PetriNetUnfolder]: For 676/687 co-relation queries the response was YES. [2022-07-13 21:40:32,500 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5463 conditions, 2859 events. 890/2859 cut-off events. For 676/687 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 26254 event pairs, 295 based on Foata normal form. 124/2858 useless extension candidates. Maximal degree in co-relation 4840. Up to 649 conditions per place. [2022-07-13 21:40:32,508 INFO L132 encePairwiseOnDemand]: 106/112 looper letters, 19 selfloop transitions, 4 changer transitions 0/124 dead transitions. [2022-07-13 21:40:32,509 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 124 transitions, 433 flow [2022-07-13 21:40:32,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:40:32,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-13 21:40:32,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2022-07-13 21:40:32,510 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9107142857142857 [2022-07-13 21:40:32,510 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 306 transitions. [2022-07-13 21:40:32,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 306 transitions. [2022-07-13 21:40:32,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:40:32,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 306 transitions. [2022-07-13 21:40:32,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:32,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:32,512 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:32,512 INFO L186 Difference]: Start difference. First operand has 115 places, 117 transitions, 367 flow. Second operand 3 states and 306 transitions. [2022-07-13 21:40:32,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 124 transitions, 433 flow [2022-07-13 21:40:32,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 124 transitions, 433 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-13 21:40:32,523 INFO L242 Difference]: Finished difference. Result has 118 places, 117 transitions, 383 flow [2022-07-13 21:40:32,523 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=383, PETRI_PLACES=118, PETRI_TRANSITIONS=117} [2022-07-13 21:40:32,524 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 13 predicate places. [2022-07-13 21:40:32,524 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 117 transitions, 383 flow [2022-07-13 21:40:32,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:32,525 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:40:32,525 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:40:32,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 21:40:32,525 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:40:32,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:40:32,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1184537247, now seen corresponding path program 2 times [2022-07-13 21:40:32,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:40:32,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730293502] [2022-07-13 21:40:32,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:40:32,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:40:32,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:40:32,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:40:32,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:40:32,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730293502] [2022-07-13 21:40:32,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730293502] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:40:32,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:40:32,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 21:40:32,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603065311] [2022-07-13 21:40:32,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:40:32,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 21:40:32,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:40:32,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 21:40:32,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 21:40:32,591 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 112 [2022-07-13 21:40:32,591 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 117 transitions, 383 flow. Second operand has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:32,591 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:40:32,592 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 112 [2022-07-13 21:40:32,592 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:40:32,890 INFO L129 PetriNetUnfolder]: 764/3304 cut-off events. [2022-07-13 21:40:32,890 INFO L130 PetriNetUnfolder]: For 1453/1513 co-relation queries the response was YES. [2022-07-13 21:40:32,902 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6340 conditions, 3304 events. 764/3304 cut-off events. For 1453/1513 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 34879 event pairs, 48 based on Foata normal form. 67/3219 useless extension candidates. Maximal degree in co-relation 5566. Up to 527 conditions per place. [2022-07-13 21:40:32,939 INFO L132 encePairwiseOnDemand]: 103/112 looper letters, 27 selfloop transitions, 19 changer transitions 2/148 dead transitions. [2022-07-13 21:40:32,939 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 148 transitions, 585 flow [2022-07-13 21:40:32,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 21:40:32,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-13 21:40:32,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 510 transitions. [2022-07-13 21:40:32,941 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9107142857142857 [2022-07-13 21:40:32,941 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 510 transitions. [2022-07-13 21:40:32,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 510 transitions. [2022-07-13 21:40:32,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:40:32,941 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 510 transitions. [2022-07-13 21:40:32,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:32,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:32,944 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:32,944 INFO L186 Difference]: Start difference. First operand has 118 places, 117 transitions, 383 flow. Second operand 5 states and 510 transitions. [2022-07-13 21:40:32,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 148 transitions, 585 flow [2022-07-13 21:40:32,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 148 transitions, 565 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-13 21:40:32,952 INFO L242 Difference]: Finished difference. Result has 120 places, 131 transitions, 461 flow [2022-07-13 21:40:32,952 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=461, PETRI_PLACES=120, PETRI_TRANSITIONS=131} [2022-07-13 21:40:32,953 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 15 predicate places. [2022-07-13 21:40:32,953 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 131 transitions, 461 flow [2022-07-13 21:40:32,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:32,953 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:40:32,953 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:40:32,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 21:40:32,954 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:40:32,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:40:32,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1149119989, now seen corresponding path program 1 times [2022-07-13 21:40:32,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:40:32,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128567485] [2022-07-13 21:40:32,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:40:32,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:40:32,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:40:33,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:40:33,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:40:33,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128567485] [2022-07-13 21:40:33,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128567485] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:40:33,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:40:33,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:40:33,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816436957] [2022-07-13 21:40:33,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:40:33,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:40:33,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:40:33,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:40:33,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:40:33,007 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 112 [2022-07-13 21:40:33,007 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 131 transitions, 461 flow. Second operand has 6 states, 6 states have (on average 83.16666666666667) internal successors, (499), 6 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:33,008 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:40:33,008 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 112 [2022-07-13 21:40:33,008 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:40:34,248 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([249] L739-2-->L740: Formula: (= v_~r~0_17 (+ (- 1) v_~r~0_18)) InVars {~r~0=v_~r~0_18} OutVars{~r~0=v_~r~0_17} AuxVars[] AssignedVars[~r~0][355], [60#L748-4true, 170#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), 102#L740true, 131#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 71#L740true, 158#true, 94#L721true, 116#L721true, Black: 139#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 141#(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) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 135#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 128#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 133#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 126#true, readerThread1of1ForFork3InUse, Black: 155#(= ~w~0 1)]) [2022-07-13 21:40:34,252 INFO L384 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-07-13 21:40:34,252 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-07-13 21:40:34,252 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-07-13 21:40:34,253 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-07-13 21:40:34,623 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([249] L739-2-->L740: Formula: (= v_~r~0_17 (+ (- 1) v_~r~0_18)) InVars {~r~0=v_~r~0_18} OutVars{~r~0=v_~r~0_17} AuxVars[] AssignedVars[~r~0][355], [170#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), 107#L749-2true, 131#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 102#L740true, 71#L740true, 158#true, 116#L721true, Black: 139#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 141#(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) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 135#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 128#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 133#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 126#true, readerThread1of1ForFork3InUse, Black: 155#(= ~w~0 1)]) [2022-07-13 21:40:34,623 INFO L384 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-07-13 21:40:34,623 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-13 21:40:34,623 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-13 21:40:34,623 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-13 21:40:34,741 INFO L129 PetriNetUnfolder]: 8503/19148 cut-off events. [2022-07-13 21:40:34,742 INFO L130 PetriNetUnfolder]: For 16785/16832 co-relation queries the response was YES. [2022-07-13 21:40:34,823 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47526 conditions, 19148 events. 8503/19148 cut-off events. For 16785/16832 co-relation queries the response was YES. Maximal size of possible extension queue 1820. Compared 217414 event pairs, 1734 based on Foata normal form. 13/18572 useless extension candidates. Maximal degree in co-relation 46936. Up to 4078 conditions per place. [2022-07-13 21:40:34,883 INFO L132 encePairwiseOnDemand]: 103/112 looper letters, 193 selfloop transitions, 94 changer transitions 32/387 dead transitions. [2022-07-13 21:40:34,883 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 387 transitions, 2315 flow [2022-07-13 21:40:34,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 21:40:34,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-13 21:40:34,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 950 transitions. [2022-07-13 21:40:34,886 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8482142857142857 [2022-07-13 21:40:34,886 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 950 transitions. [2022-07-13 21:40:34,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 950 transitions. [2022-07-13 21:40:34,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:40:34,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 950 transitions. [2022-07-13 21:40:34,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 95.0) internal successors, (950), 10 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:34,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:34,890 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:34,890 INFO L186 Difference]: Start difference. First operand has 120 places, 131 transitions, 461 flow. Second operand 10 states and 950 transitions. [2022-07-13 21:40:34,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 387 transitions, 2315 flow [2022-07-13 21:40:35,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 387 transitions, 2309 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-07-13 21:40:35,004 INFO L242 Difference]: Finished difference. Result has 137 places, 240 transitions, 1484 flow [2022-07-13 21:40:35,005 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1484, PETRI_PLACES=137, PETRI_TRANSITIONS=240} [2022-07-13 21:40:35,005 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 32 predicate places. [2022-07-13 21:40:35,006 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 240 transitions, 1484 flow [2022-07-13 21:40:35,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.16666666666667) internal successors, (499), 6 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:35,006 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:40:35,006 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:40:35,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 21:40:35,007 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:40:35,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:40:35,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1910529791, now seen corresponding path program 1 times [2022-07-13 21:40:35,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:40:35,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214577356] [2022-07-13 21:40:35,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:40:35,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:40:35,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:40:35,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:40:35,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:40:35,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214577356] [2022-07-13 21:40:35,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214577356] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:40:35,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:40:35,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:40:35,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185494056] [2022-07-13 21:40:35,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:40:35,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:40:35,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:40:35,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:40:35,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:40:35,063 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 112 [2022-07-13 21:40:35,063 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 240 transitions, 1484 flow. Second operand has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:35,063 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:40:35,063 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 112 [2022-07-13 21:40:35,063 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:40:36,640 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([263] L739-2-->L740: Formula: (= v_~r~0_17 (+ (- 1) v_~r~0_18)) InVars {~r~0=v_~r~0_18} OutVars{~r~0=v_~r~0_17} AuxVars[] AssignedVars[~r~0][400], [60#L748-4true, 170#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), 131#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 102#L740true, 94#L721true, 158#true, Black: 139#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 141#(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) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 135#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 128#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 133#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 126#true, Black: 155#(= ~w~0 1), 71#L740true, 197#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 116#L721true, readerThread1of1ForFork3InUse, Black: 172#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 180#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 165#true, Black: 176#(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: 174#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 167#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 178#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|))]) [2022-07-13 21:40:36,640 INFO L384 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-07-13 21:40:36,641 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-07-13 21:40:36,641 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-07-13 21:40:36,641 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-07-13 21:40:37,109 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([263] L739-2-->L740: Formula: (= v_~r~0_17 (+ (- 1) v_~r~0_18)) InVars {~r~0=v_~r~0_18} OutVars{~r~0=v_~r~0_17} AuxVars[] AssignedVars[~r~0][400], [170#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), 107#L749-2true, 131#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 102#L740true, 71#L740true, 197#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 158#true, 116#L721true, Black: 139#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 141#(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) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 135#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 128#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 133#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), readerThread1of1ForFork3InUse, Black: 126#true, Black: 172#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 180#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 165#true, Black: 176#(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: 155#(= ~w~0 1), Black: 174#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 167#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 178#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|))]) [2022-07-13 21:40:37,109 INFO L384 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-07-13 21:40:37,109 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-13 21:40:37,109 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-13 21:40:37,109 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-13 21:40:37,196 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([263] L739-2-->L740: Formula: (= v_~r~0_17 (+ (- 1) v_~r~0_18)) InVars {~r~0=v_~r~0_18} OutVars{~r~0=v_~r~0_17} AuxVars[] AssignedVars[~r~0][400], [170#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), 131#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 71#L740true, 197#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 158#true, 116#L721true, Black: 139#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 141#(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) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 135#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 128#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 133#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), readerThread1of1ForFork3InUse, Black: 126#true, Black: 172#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 180#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 165#true, 45#L750-2true, Black: 176#(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: 155#(= ~w~0 1), Black: 174#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 167#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 178#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|))]) [2022-07-13 21:40:37,197 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-07-13 21:40:37,197 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-13 21:40:37,197 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-13 21:40:37,197 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-13 21:40:37,227 INFO L129 PetriNetUnfolder]: 8574/19932 cut-off events. [2022-07-13 21:40:37,227 INFO L130 PetriNetUnfolder]: For 32598/32645 co-relation queries the response was YES. [2022-07-13 21:40:37,307 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59393 conditions, 19932 events. 8574/19932 cut-off events. For 32598/32645 co-relation queries the response was YES. Maximal size of possible extension queue 1948. Compared 230833 event pairs, 1383 based on Foata normal form. 192/19932 useless extension candidates. Maximal degree in co-relation 58742. Up to 3646 conditions per place. [2022-07-13 21:40:37,363 INFO L132 encePairwiseOnDemand]: 103/112 looper letters, 187 selfloop transitions, 131 changer transitions 43/429 dead transitions. [2022-07-13 21:40:37,363 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 429 transitions, 3375 flow [2022-07-13 21:40:37,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 21:40:37,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-13 21:40:37,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 849 transitions. [2022-07-13 21:40:37,366 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8422619047619048 [2022-07-13 21:40:37,366 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 849 transitions. [2022-07-13 21:40:37,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 849 transitions. [2022-07-13 21:40:37,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:40:37,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 849 transitions. [2022-07-13 21:40:37,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 94.33333333333333) internal successors, (849), 9 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:37,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:37,371 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:37,371 INFO L186 Difference]: Start difference. First operand has 137 places, 240 transitions, 1484 flow. Second operand 9 states and 849 transitions. [2022-07-13 21:40:37,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 429 transitions, 3375 flow [2022-07-13 21:40:37,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 429 transitions, 3375 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-13 21:40:37,637 INFO L242 Difference]: Finished difference. Result has 150 places, 282 transitions, 2293 flow [2022-07-13 21:40:37,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=1484, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2293, PETRI_PLACES=150, PETRI_TRANSITIONS=282} [2022-07-13 21:40:37,638 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 45 predicate places. [2022-07-13 21:40:37,638 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 282 transitions, 2293 flow [2022-07-13 21:40:37,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:37,639 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:40:37,639 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:40:37,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 21:40:37,639 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:40:37,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:40:37,640 INFO L85 PathProgramCache]: Analyzing trace with hash -2041915451, now seen corresponding path program 1 times [2022-07-13 21:40:37,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:40:37,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468171282] [2022-07-13 21:40:37,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:40:37,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:40:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:40:37,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:40:37,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:40:37,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468171282] [2022-07-13 21:40:37,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468171282] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:40:37,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:40:37,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 21:40:37,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423123761] [2022-07-13 21:40:37,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:40:37,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 21:40:37,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:40:37,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 21:40:37,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:40:37,696 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 112 [2022-07-13 21:40:37,697 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 282 transitions, 2293 flow. Second operand has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:37,697 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:40:37,697 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 112 [2022-07-13 21:40:37,697 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:40:39,384 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([249] L739-2-->L740: Formula: (= v_~r~0_17 (+ (- 1) v_~r~0_18)) InVars {~r~0=v_~r~0_18} OutVars{~r~0=v_~r~0_17} AuxVars[] AssignedVars[~r~0][400], [60#L748-4true, 220#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), 170#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), 161#(or (not (= ~w~0 0)) (not (= ~r~0 0))), 131#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 102#L740true, 94#L721true, Black: 139#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 141#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 199#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 192#true, Black: 137#(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: 135#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 206#(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: 128#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 202#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 133#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 126#true, Black: 155#(= ~w~0 1), 197#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 116#L721true, 27#L739-2true, readerThread1of1ForFork3InUse, Black: 172#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 180#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 165#true, Black: 176#(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: 174#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 167#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 178#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|))]) [2022-07-13 21:40:39,384 INFO L384 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2022-07-13 21:40:39,384 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-07-13 21:40:39,384 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-07-13 21:40:39,384 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-07-13 21:40:39,818 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([249] L739-2-->L740: Formula: (= v_~r~0_17 (+ (- 1) v_~r~0_18)) InVars {~r~0=v_~r~0_18} OutVars{~r~0=v_~r~0_17} AuxVars[] AssignedVars[~r~0][400], [220#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), 170#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), 161#(or (not (= ~w~0 0)) (not (= ~r~0 0))), 107#L749-2true, 102#L740true, 131#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), Black: 139#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 141#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 199#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 137#(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: 192#true, Black: 206#(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: 135#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 128#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 202#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 133#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 126#true, Black: 155#(= ~w~0 1), 197#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 116#L721true, 27#L739-2true, readerThread1of1ForFork3InUse, Black: 172#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 180#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 165#true, Black: 176#(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: 174#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 167#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 178#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|))]) [2022-07-13 21:40:39,818 INFO L384 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-07-13 21:40:39,818 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-07-13 21:40:39,818 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-07-13 21:40:39,818 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-07-13 21:40:40,046 INFO L129 PetriNetUnfolder]: 9007/21302 cut-off events. [2022-07-13 21:40:40,047 INFO L130 PetriNetUnfolder]: For 48784/48840 co-relation queries the response was YES. [2022-07-13 21:40:40,297 INFO L84 FinitePrefix]: Finished finitePrefix Result has 66805 conditions, 21302 events. 9007/21302 cut-off events. For 48784/48840 co-relation queries the response was YES. Maximal size of possible extension queue 2128. Compared 254314 event pairs, 1694 based on Foata normal form. 234/21336 useless extension candidates. Maximal degree in co-relation 66043. Up to 4373 conditions per place. [2022-07-13 21:40:40,358 INFO L132 encePairwiseOnDemand]: 103/112 looper letters, 219 selfloop transitions, 163 changer transitions 29/486 dead transitions. [2022-07-13 21:40:40,358 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 486 transitions, 4497 flow [2022-07-13 21:40:40,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 21:40:40,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-13 21:40:40,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 859 transitions. [2022-07-13 21:40:40,361 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8521825396825397 [2022-07-13 21:40:40,361 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 859 transitions. [2022-07-13 21:40:40,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 859 transitions. [2022-07-13 21:40:40,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:40:40,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 859 transitions. [2022-07-13 21:40:40,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 95.44444444444444) internal successors, (859), 9 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:40,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:40,365 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:40,366 INFO L186 Difference]: Start difference. First operand has 150 places, 282 transitions, 2293 flow. Second operand 9 states and 859 transitions. [2022-07-13 21:40:40,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 486 transitions, 4497 flow [2022-07-13 21:40:40,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 486 transitions, 4469 flow, removed 14 selfloop flow, removed 0 redundant places. [2022-07-13 21:40:40,700 INFO L242 Difference]: Finished difference. Result has 163 places, 343 transitions, 3468 flow [2022-07-13 21:40:40,700 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=2283, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3468, PETRI_PLACES=163, PETRI_TRANSITIONS=343} [2022-07-13 21:40:40,702 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 58 predicate places. [2022-07-13 21:40:40,703 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 343 transitions, 3468 flow [2022-07-13 21:40:40,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:40,703 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:40:40,703 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:40:40,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 21:40:40,704 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:40:40,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:40:40,704 INFO L85 PathProgramCache]: Analyzing trace with hash -861672747, now seen corresponding path program 1 times [2022-07-13 21:40:40,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:40:40,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457532525] [2022-07-13 21:40:40,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:40:40,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:40:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:40:40,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:40:40,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:40:40,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457532525] [2022-07-13 21:40:40,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457532525] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:40:40,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:40:40,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 21:40:40,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031134662] [2022-07-13 21:40:40,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:40:40,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 21:40:40,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:40:40,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 21:40:40,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 21:40:40,796 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 112 [2022-07-13 21:40:40,797 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 343 transitions, 3468 flow. Second operand has 5 states, 5 states have (on average 96.6) internal successors, (483), 5 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:40,798 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:40:40,798 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 112 [2022-07-13 21:40:40,798 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:40:41,125 INFO L129 PetriNetUnfolder]: 387/2261 cut-off events. [2022-07-13 21:40:41,125 INFO L130 PetriNetUnfolder]: For 4229/4407 co-relation queries the response was YES. [2022-07-13 21:40:41,138 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6409 conditions, 2261 events. 387/2261 cut-off events. For 4229/4407 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 22757 event pairs, 50 based on Foata normal form. 134/2373 useless extension candidates. Maximal degree in co-relation 6159. Up to 285 conditions per place. [2022-07-13 21:40:41,141 INFO L132 encePairwiseOnDemand]: 105/112 looper letters, 18 selfloop transitions, 9 changer transitions 35/190 dead transitions. [2022-07-13 21:40:41,141 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 190 transitions, 1296 flow [2022-07-13 21:40:41,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 21:40:41,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-13 21:40:41,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 516 transitions. [2022-07-13 21:40:41,143 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9214285714285714 [2022-07-13 21:40:41,143 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 516 transitions. [2022-07-13 21:40:41,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 516 transitions. [2022-07-13 21:40:41,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:40:41,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 516 transitions. [2022-07-13 21:40:41,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.2) internal successors, (516), 5 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:41,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:41,149 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:41,149 INFO L186 Difference]: Start difference. First operand has 163 places, 343 transitions, 3468 flow. Second operand 5 states and 516 transitions. [2022-07-13 21:40:41,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 190 transitions, 1296 flow [2022-07-13 21:40:41,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 190 transitions, 1227 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-07-13 21:40:41,172 INFO L242 Difference]: Finished difference. Result has 163 places, 148 transitions, 877 flow [2022-07-13 21:40:41,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=877, PETRI_PLACES=163, PETRI_TRANSITIONS=148} [2022-07-13 21:40:41,173 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 58 predicate places. [2022-07-13 21:40:41,173 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 148 transitions, 877 flow [2022-07-13 21:40:41,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.6) internal successors, (483), 5 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:41,174 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:40:41,174 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] [2022-07-13 21:40:41,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 21:40:41,174 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:40:41,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:40:41,175 INFO L85 PathProgramCache]: Analyzing trace with hash 334077518, now seen corresponding path program 1 times [2022-07-13 21:40:41,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:40:41,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139134299] [2022-07-13 21:40:41,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:40:41,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:40:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:40:41,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:40:41,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:40:41,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139134299] [2022-07-13 21:40:41,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139134299] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:40:41,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:40:41,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 21:40:41,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545895198] [2022-07-13 21:40:41,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:40:41,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 21:40:41,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:40:41,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 21:40:41,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 21:40:41,232 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 112 [2022-07-13 21:40:41,233 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 148 transitions, 877 flow. Second operand has 5 states, 5 states have (on average 96.8) internal successors, (484), 5 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:41,233 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:40:41,233 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 112 [2022-07-13 21:40:41,233 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:40:41,315 INFO L129 PetriNetUnfolder]: 78/689 cut-off events. [2022-07-13 21:40:41,315 INFO L130 PetriNetUnfolder]: For 956/959 co-relation queries the response was YES. [2022-07-13 21:40:41,319 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2003 conditions, 689 events. 78/689 cut-off events. For 956/959 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4685 event pairs, 19 based on Foata normal form. 11/696 useless extension candidates. Maximal degree in co-relation 1975. Up to 81 conditions per place. [2022-07-13 21:40:41,319 INFO L132 encePairwiseOnDemand]: 105/112 looper letters, 0 selfloop transitions, 0 changer transitions 118/118 dead transitions. [2022-07-13 21:40:41,319 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 118 transitions, 556 flow [2022-07-13 21:40:41,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 21:40:41,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-13 21:40:41,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 505 transitions. [2022-07-13 21:40:41,321 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9017857142857143 [2022-07-13 21:40:41,321 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 505 transitions. [2022-07-13 21:40:41,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 505 transitions. [2022-07-13 21:40:41,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:40:41,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 505 transitions. [2022-07-13 21:40:41,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:41,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:41,324 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:41,324 INFO L186 Difference]: Start difference. First operand has 163 places, 148 transitions, 877 flow. Second operand 5 states and 505 transitions. [2022-07-13 21:40:41,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 118 transitions, 556 flow [2022-07-13 21:40:41,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 118 transitions, 438 flow, removed 12 selfloop flow, removed 26 redundant places. [2022-07-13 21:40:41,330 INFO L242 Difference]: Finished difference. Result has 129 places, 0 transitions, 0 flow [2022-07-13 21:40:41,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=129, PETRI_TRANSITIONS=0} [2022-07-13 21:40:41,331 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 24 predicate places. [2022-07-13 21:40:41,331 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 0 transitions, 0 flow [2022-07-13 21:40:41,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.8) internal successors, (484), 5 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:40:41,334 INFO L805 garLoopResultBuilder]: Registering result SAFE for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-07-13 21:40:41,334 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 7 remaining) [2022-07-13 21:40:41,334 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-07-13 21:40:41,335 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-07-13 21:40:41,335 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-07-13 21:40:41,335 INFO L805 garLoopResultBuilder]: Registering result SAFE for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2022-07-13 21:40:41,335 INFO L805 garLoopResultBuilder]: Registering result SAFE for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-07-13 21:40:41,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 21:40:41,336 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-07-13 21:40:41,340 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-13 21:40:41,340 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 21:40:41,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 09:40:41 BasicIcfg [2022-07-13 21:40:41,345 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 21:40:41,346 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 21:40:41,346 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 21:40:41,346 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 21:40:41,347 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:40:30" (3/4) ... [2022-07-13 21:40:41,348 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-13 21:40:41,352 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reader [2022-07-13 21:40:41,353 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure writer [2022-07-13 21:40:41,355 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2022-07-13 21:40:41,356 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-07-13 21:40:41,356 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-13 21:40:41,356 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-13 21:40:41,378 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 21:40:41,378 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 21:40:41,379 INFO L158 Benchmark]: Toolchain (without parser) took 11940.53ms. Allocated memory was 102.8MB in the beginning and 4.7GB in the end (delta: 4.6GB). Free memory was 72.0MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 865.2MB. Max. memory is 16.1GB. [2022-07-13 21:40:41,379 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 102.8MB. Free memory is still 56.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 21:40:41,380 INFO L158 Benchmark]: CACSL2BoogieTranslator took 456.53ms. Allocated memory was 102.8MB in the beginning and 132.1MB in the end (delta: 29.4MB). Free memory was 71.8MB in the beginning and 96.9MB in the end (delta: -25.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 21:40:41,380 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.35ms. Allocated memory is still 132.1MB. Free memory was 96.9MB in the beginning and 94.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 21:40:41,380 INFO L158 Benchmark]: Boogie Preprocessor took 49.77ms. Allocated memory is still 132.1MB. Free memory was 94.5MB in the beginning and 93.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 21:40:41,381 INFO L158 Benchmark]: RCFGBuilder took 369.94ms. Allocated memory is still 132.1MB. Free memory was 93.2MB in the beginning and 79.0MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-13 21:40:41,381 INFO L158 Benchmark]: TraceAbstraction took 10955.61ms. Allocated memory was 132.1MB in the beginning and 4.7GB in the end (delta: 4.5GB). Free memory was 78.2MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 842.9MB. Max. memory is 16.1GB. [2022-07-13 21:40:41,381 INFO L158 Benchmark]: Witness Printer took 32.65ms. Allocated memory is still 4.7GB. Free memory was 3.8GB in the beginning and 3.8GB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 21:40:41,383 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.22ms. Allocated memory is still 102.8MB. Free memory is still 56.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 456.53ms. Allocated memory was 102.8MB in the beginning and 132.1MB in the end (delta: 29.4MB). Free memory was 71.8MB in the beginning and 96.9MB in the end (delta: -25.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.35ms. Allocated memory is still 132.1MB. Free memory was 96.9MB in the beginning and 94.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.77ms. Allocated memory is still 132.1MB. Free memory was 94.5MB in the beginning and 93.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 369.94ms. Allocated memory is still 132.1MB. Free memory was 93.2MB in the beginning and 79.0MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 10955.61ms. Allocated memory was 132.1MB in the beginning and 4.7GB in the end (delta: 4.5GB). Free memory was 78.2MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 842.9MB. Max. memory is 16.1GB. * Witness Printer took 32.65ms. Allocated memory is still 4.7GB. Free memory was 3.8GB in the beginning and 3.8GB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 739]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 136 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: 10.8s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 442 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 442 mSDsluCounter, 269 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 675 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1315 IncrementalHoareTripleChecker+Invalid, 1356 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 120 mSDtfsCounter, 1315 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3468occurred in iteration=6, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 406 NumberOfCodeBlocks, 406 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 398 ConstructedInterpolants, 0 QuantifiedInterpolants, 686 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-07-13 21:40:41,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE