/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-After.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 10:25:03,593 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 10:25:03,594 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 10:25:03,637 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 10:25:03,637 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 10:25:03,638 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 10:25:03,639 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 10:25:03,640 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 10:25:03,641 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 10:25:03,641 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 10:25:03,642 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 10:25:03,642 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 10:25:03,643 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 10:25:03,645 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 10:25:03,645 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 10:25:03,646 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 10:25:03,646 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 10:25:03,647 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 10:25:03,648 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 10:25:03,649 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 10:25:03,650 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 10:25:03,651 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 10:25:03,652 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 10:25:03,652 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 10:25:03,654 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 10:25:03,654 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 10:25:03,655 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 10:25:03,655 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 10:25:03,655 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 10:25:03,656 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 10:25:03,656 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 10:25:03,657 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 10:25:03,657 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 10:25:03,657 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 10:25:03,658 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 10:25:03,658 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 10:25:03,659 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 10:25:03,659 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 10:25:03,659 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 10:25:03,659 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 10:25:03,660 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 10:25:03,664 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-After.epf [2022-01-19 10:25:03,688 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 10:25:03,688 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 10:25:03,689 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 10:25:03,689 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 10:25:03,689 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 10:25:03,689 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 10:25:03,689 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 10:25:03,689 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 10:25:03,690 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 10:25:03,690 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 10:25:03,690 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 10:25:03,690 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 10:25:03,690 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 10:25:03,690 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 10:25:03,690 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 10:25:03,690 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 10:25:03,690 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 10:25:03,690 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 10:25:03,690 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 10:25:03,691 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 10:25:03,691 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 10:25:03,691 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 10:25:03,691 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 10:25:03,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 10:25:03,691 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 10:25:03,691 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 10:25:03,691 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 10:25:03,691 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 10:25:03,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 10:25:03,692 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 10:25:03,692 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 10:25:03,692 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=AFTER [2022-01-19 10:25:03,692 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 [2022-01-19 10:25:03,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 10:25:03,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 10:25:03,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 10:25:03,856 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 10:25:03,857 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 10:25:03,857 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i [2022-01-19 10:25:03,927 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcdc677fa/8da22c48265546be9dc3bf9ea9ae7921/FLAGfd8d4d2ba [2022-01-19 10:25:04,298 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 10:25:04,298 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i [2022-01-19 10:25:04,307 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcdc677fa/8da22c48265546be9dc3bf9ea9ae7921/FLAGfd8d4d2ba [2022-01-19 10:25:04,322 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcdc677fa/8da22c48265546be9dc3bf9ea9ae7921 [2022-01-19 10:25:04,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 10:25:04,326 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 10:25:04,331 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 10:25:04,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 10:25:04,333 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 10:25:04,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 10:25:04" (1/1) ... [2022-01-19 10:25:04,334 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@214f5b13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:25:04, skipping insertion in model container [2022-01-19 10:25:04,334 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 10:25:04" (1/1) ... [2022-01-19 10:25:04,338 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 10:25:04,361 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 10:25:04,482 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-01-19 10:25:04,546 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i[31244,31257] [2022-01-19 10:25:04,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 10:25:04,556 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 10:25:04,564 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-01-19 10:25:04,579 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i[31244,31257] [2022-01-19 10:25:04,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 10:25:04,629 INFO L208 MainTranslator]: Completed translation [2022-01-19 10:25:04,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:25:04 WrapperNode [2022-01-19 10:25:04,630 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 10:25:04,631 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 10:25:04,631 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 10:25:04,631 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 10:25:04,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:25:04" (1/1) ... [2022-01-19 10:25:04,647 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:25:04" (1/1) ... [2022-01-19 10:25:04,661 INFO L137 Inliner]: procedures = 174, calls = 51, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 119 [2022-01-19 10:25:04,661 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 10:25:04,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 10:25:04,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 10:25:04,662 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 10:25:04,667 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:25:04" (1/1) ... [2022-01-19 10:25:04,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:25:04" (1/1) ... [2022-01-19 10:25:04,669 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:25:04" (1/1) ... [2022-01-19 10:25:04,670 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:25:04" (1/1) ... [2022-01-19 10:25:04,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:25:04" (1/1) ... [2022-01-19 10:25:04,673 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:25:04" (1/1) ... [2022-01-19 10:25:04,674 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:25:04" (1/1) ... [2022-01-19 10:25:04,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 10:25:04,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 10:25:04,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 10:25:04,677 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 10:25:04,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:25:04" (1/1) ... [2022-01-19 10:25:04,688 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 10:25:04,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 10:25:04,722 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-01-19 10:25:04,724 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-01-19 10:25:04,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 10:25:04,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 10:25:04,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 10:25:04,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 10:25:04,754 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2022-01-19 10:25:04,754 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2022-01-19 10:25:04,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 10:25:04,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 10:25:04,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 10:25:04,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 10:25:04,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 10:25:04,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 10:25:04,755 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2022-01-19 10:25:04,755 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2022-01-19 10:25:04,756 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 10:25:04,852 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 10:25:04,853 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 10:25:05,024 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 10:25:05,041 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 10:25:05,041 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-19 10:25:05,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 10:25:05 BoogieIcfgContainer [2022-01-19 10:25:05,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 10:25:05,044 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 10:25:05,044 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 10:25:05,047 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 10:25:05,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 10:25:04" (1/3) ... [2022-01-19 10:25:05,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b197953 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 10:25:05, skipping insertion in model container [2022-01-19 10:25:05,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:25:04" (2/3) ... [2022-01-19 10:25:05,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b197953 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 10:25:05, skipping insertion in model container [2022-01-19 10:25:05,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 10:25:05" (3/3) ... [2022-01-19 10:25:05,049 INFO L111 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2022-01-19 10:25:05,052 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 10:25:05,052 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 10:25:05,052 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 10:25:05,088 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,088 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,088 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,089 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,089 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,089 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,089 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,089 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,089 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,089 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,090 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,090 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,090 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,090 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,090 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,090 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,091 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,091 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,091 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,091 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,091 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,091 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,091 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,091 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,092 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,092 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,092 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,092 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,092 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,092 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,092 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,093 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,093 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,093 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,093 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,093 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,093 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,093 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,094 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,094 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,094 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,094 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,094 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,094 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,094 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,094 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,095 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,095 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,095 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,095 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,095 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,095 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,095 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,096 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,096 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,096 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,096 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,096 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,096 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,096 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,097 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,097 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,097 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,097 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,097 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,097 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,097 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,097 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,097 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,098 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,098 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,098 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,098 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,098 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,098 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,099 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,099 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,099 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,099 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,099 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,099 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,099 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,099 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,100 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,100 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,100 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,100 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,100 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,101 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,101 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,101 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,101 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,101 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,101 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,101 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,101 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,102 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,102 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,102 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,102 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,102 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,102 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,102 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,102 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,103 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,108 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,108 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,108 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,110 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,110 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,110 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,111 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,111 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,111 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,111 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,112 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,112 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,114 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,114 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,114 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,114 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,115 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,115 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,117 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,117 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,117 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,117 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,117 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,118 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,119 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,119 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,119 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,119 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,119 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,120 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,120 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,120 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,120 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:25:05,134 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-01-19 10:25:05,171 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 10:25:05,175 INFO L339 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=false, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 10:25:05,175 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-01-19 10:25:05,184 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 125 places, 114 transitions, 260 flow [2022-01-19 10:25:05,226 INFO L129 PetriNetUnfolder]: 2/110 cut-off events. [2022-01-19 10:25:05,226 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-01-19 10:25:05,230 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 110 events. 2/110 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-01-19 10:25:05,230 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 114 transitions, 260 flow [2022-01-19 10:25:05,233 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 96 transitions, 213 flow [2022-01-19 10:25:05,244 INFO L129 PetriNetUnfolder]: 1/59 cut-off events. [2022-01-19 10:25:05,244 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 10:25:05,244 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:25:05,245 INFO L254 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-01-19 10:25:05,245 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2022-01-19 10:25:05,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:25:05,248 INFO L85 PathProgramCache]: Analyzing trace with hash 2006515335, now seen corresponding path program 1 times [2022-01-19 10:25:05,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:25:05,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925475531] [2022-01-19 10:25:05,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:25:05,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:25:05,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:25:05,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:25:05,450 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:25:05,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925475531] [2022-01-19 10:25:05,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925475531] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:25:05,451 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:25:05,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 10:25:05,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953013090] [2022-01-19 10:25:05,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:25:05,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 10:25:05,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:25:05,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 10:25:05,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 10:25:05,479 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114 [2022-01-19 10:25:05,481 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 96 transitions, 213 flow. Second operand has 6 states, 6 states have (on average 84.83333333333333) internal successors, (509), 6 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:25:05,481 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:25:05,482 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114 [2022-01-19 10:25:05,482 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:25:06,282 INFO L129 PetriNetUnfolder]: 3525/7769 cut-off events. [2022-01-19 10:25:06,283 INFO L130 PetriNetUnfolder]: For 1654/1654 co-relation queries the response was YES. [2022-01-19 10:25:06,301 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13923 conditions, 7769 events. 3525/7769 cut-off events. For 1654/1654 co-relation queries the response was YES. Maximal size of possible extension queue 563. Compared 71695 event pairs, 961 based on Foata normal form. 422/7837 useless extension candidates. Maximal degree in co-relation 13398. Up to 1729 conditions per place. [2022-01-19 10:25:06,331 INFO L132 encePairwiseOnDemand]: 102/114 looper letters, 116 selfloop transitions, 32 changer transitions 0/214 dead transitions. [2022-01-19 10:25:06,331 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 214 transitions, 823 flow [2022-01-19 10:25:06,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 10:25:06,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 10:25:06,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1160 transitions. [2022-01-19 10:25:06,345 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.847953216374269 [2022-01-19 10:25:06,345 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1160 transitions. [2022-01-19 10:25:06,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1160 transitions. [2022-01-19 10:25:06,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:25:06,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1160 transitions. [2022-01-19 10:25:06,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 96.66666666666667) internal successors, (1160), 12 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:25:06,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:25:06,362 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:25:06,363 INFO L186 Difference]: Start difference. First operand has 107 places, 96 transitions, 213 flow. Second operand 12 states and 1160 transitions. [2022-01-19 10:25:06,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 214 transitions, 823 flow [2022-01-19 10:25:06,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 214 transitions, 764 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-01-19 10:25:06,379 INFO L242 Difference]: Finished difference. Result has 119 places, 129 transitions, 416 flow [2022-01-19 10:25:06,381 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=416, PETRI_PLACES=119, PETRI_TRANSITIONS=129} [2022-01-19 10:25:06,383 INFO L334 CegarLoopForPetriNet]: 107 programPoint places, 12 predicate places. [2022-01-19 10:25:06,383 INFO L470 AbstractCegarLoop]: Abstraction has has 119 places, 129 transitions, 416 flow [2022-01-19 10:25:06,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.83333333333333) internal successors, (509), 6 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:25:06,384 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:25:06,384 INFO L254 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-01-19 10:25:06,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 10:25:06,384 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2022-01-19 10:25:06,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:25:06,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1738116757, now seen corresponding path program 1 times [2022-01-19 10:25:06,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:25:06,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696535482] [2022-01-19 10:25:06,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:25:06,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:25:06,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:25:06,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:25:06,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:25:06,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696535482] [2022-01-19 10:25:06,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696535482] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:25:06,474 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:25:06,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 10:25:06,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010576029] [2022-01-19 10:25:06,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:25:06,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 10:25:06,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:25:06,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 10:25:06,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 10:25:06,484 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 114 [2022-01-19 10:25:06,484 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 129 transitions, 416 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:25:06,484 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:25:06,484 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 114 [2022-01-19 10:25:06,484 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:25:06,688 INFO L129 PetriNetUnfolder]: 412/2302 cut-off events. [2022-01-19 10:25:06,689 INFO L130 PetriNetUnfolder]: For 379/394 co-relation queries the response was YES. [2022-01-19 10:25:06,696 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3924 conditions, 2302 events. 412/2302 cut-off events. For 379/394 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 22522 event pairs, 96 based on Foata normal form. 53/2230 useless extension candidates. Maximal degree in co-relation 3614. Up to 259 conditions per place. [2022-01-19 10:25:06,703 INFO L132 encePairwiseOnDemand]: 108/114 looper letters, 15 selfloop transitions, 4 changer transitions 0/134 dead transitions. [2022-01-19 10:25:06,703 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 134 transitions, 470 flow [2022-01-19 10:25:06,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 10:25:06,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 10:25:06,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2022-01-19 10:25:06,704 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9181286549707602 [2022-01-19 10:25:06,704 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2022-01-19 10:25:06,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2022-01-19 10:25:06,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:25:06,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2022-01-19 10:25:06,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:25:06,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:25:06,706 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:25:06,706 INFO L186 Difference]: Start difference. First operand has 119 places, 129 transitions, 416 flow. Second operand 3 states and 314 transitions. [2022-01-19 10:25:06,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 134 transitions, 470 flow [2022-01-19 10:25:06,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 134 transitions, 470 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 10:25:06,717 INFO L242 Difference]: Finished difference. Result has 122 places, 129 transitions, 432 flow [2022-01-19 10:25:06,717 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=432, PETRI_PLACES=122, PETRI_TRANSITIONS=129} [2022-01-19 10:25:06,718 INFO L334 CegarLoopForPetriNet]: 107 programPoint places, 15 predicate places. [2022-01-19 10:25:06,718 INFO L470 AbstractCegarLoop]: Abstraction has has 122 places, 129 transitions, 432 flow [2022-01-19 10:25:06,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:25:06,719 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:25:06,719 INFO L254 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-01-19 10:25:06,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 10:25:06,719 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2022-01-19 10:25:06,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:25:06,720 INFO L85 PathProgramCache]: Analyzing trace with hash -546292075, now seen corresponding path program 2 times [2022-01-19 10:25:06,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:25:06,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916892974] [2022-01-19 10:25:06,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:25:06,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:25:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:25:06,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:25:06,807 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:25:06,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916892974] [2022-01-19 10:25:06,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916892974] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:25:06,807 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:25:06,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 10:25:06,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797290352] [2022-01-19 10:25:06,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:25:06,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 10:25:06,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:25:06,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 10:25:06,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 10:25:06,811 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 114 [2022-01-19 10:25:06,811 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 129 transitions, 432 flow. Second operand has 4 states, 4 states have (on average 96.25) internal successors, (385), 4 states have internal predecessors, (385), 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-01-19 10:25:06,811 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:25:06,811 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 114 [2022-01-19 10:25:06,811 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:25:06,986 INFO L129 PetriNetUnfolder]: 537/2194 cut-off events. [2022-01-19 10:25:06,986 INFO L130 PetriNetUnfolder]: For 1283/1327 co-relation queries the response was YES. [2022-01-19 10:25:06,993 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4385 conditions, 2194 events. 537/2194 cut-off events. For 1283/1327 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 20325 event pairs, 80 based on Foata normal form. 99/2222 useless extension candidates. Maximal degree in co-relation 4089. Up to 343 conditions per place. [2022-01-19 10:25:06,999 INFO L132 encePairwiseOnDemand]: 107/114 looper letters, 36 selfloop transitions, 9 changer transitions 2/157 dead transitions. [2022-01-19 10:25:06,999 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 157 transitions, 626 flow [2022-01-19 10:25:06,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 10:25:06,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 10:25:07,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 422 transitions. [2022-01-19 10:25:07,000 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9254385964912281 [2022-01-19 10:25:07,000 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 422 transitions. [2022-01-19 10:25:07,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 422 transitions. [2022-01-19 10:25:07,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:25:07,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 422 transitions. [2022-01-19 10:25:07,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 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-01-19 10:25:07,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 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-01-19 10:25:07,003 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 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-01-19 10:25:07,003 INFO L186 Difference]: Start difference. First operand has 122 places, 129 transitions, 432 flow. Second operand 4 states and 422 transitions. [2022-01-19 10:25:07,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 157 transitions, 626 flow [2022-01-19 10:25:07,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 157 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 10:25:07,011 INFO L242 Difference]: Finished difference. Result has 126 places, 135 transitions, 490 flow [2022-01-19 10:25:07,011 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=490, PETRI_PLACES=126, PETRI_TRANSITIONS=135} [2022-01-19 10:25:07,012 INFO L334 CegarLoopForPetriNet]: 107 programPoint places, 19 predicate places. [2022-01-19 10:25:07,012 INFO L470 AbstractCegarLoop]: Abstraction has has 126 places, 135 transitions, 490 flow [2022-01-19 10:25:07,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.25) internal successors, (385), 4 states have internal predecessors, (385), 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-01-19 10:25:07,013 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:25:07,013 INFO L254 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-01-19 10:25:07,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 10:25:07,013 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2022-01-19 10:25:07,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:25:07,014 INFO L85 PathProgramCache]: Analyzing trace with hash 579299824, now seen corresponding path program 1 times [2022-01-19 10:25:07,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:25:07,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144164835] [2022-01-19 10:25:07,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:25:07,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:25:07,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:25:07,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:25:07,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:25:07,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144164835] [2022-01-19 10:25:07,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144164835] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:25:07,086 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:25:07,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 10:25:07,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462199113] [2022-01-19 10:25:07,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:25:07,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 10:25:07,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:25:07,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 10:25:07,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 10:25:07,090 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114 [2022-01-19 10:25:07,090 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 135 transitions, 490 flow. Second operand has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:25:07,090 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:25:07,091 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114 [2022-01-19 10:25:07,091 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:25:07,530 INFO L129 PetriNetUnfolder]: 1652/4268 cut-off events. [2022-01-19 10:25:07,530 INFO L130 PetriNetUnfolder]: For 4788/4876 co-relation queries the response was YES. [2022-01-19 10:25:07,541 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11053 conditions, 4268 events. 1652/4268 cut-off events. For 4788/4876 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 40097 event pairs, 342 based on Foata normal form. 50/4208 useless extension candidates. Maximal degree in co-relation 10551. Up to 668 conditions per place. [2022-01-19 10:25:07,549 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 123 selfloop transitions, 46 changer transitions 57/298 dead transitions. [2022-01-19 10:25:07,549 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 298 transitions, 1752 flow [2022-01-19 10:25:07,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 10:25:07,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 10:25:07,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1151 transitions. [2022-01-19 10:25:07,551 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.841374269005848 [2022-01-19 10:25:07,551 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1151 transitions. [2022-01-19 10:25:07,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1151 transitions. [2022-01-19 10:25:07,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:25:07,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1151 transitions. [2022-01-19 10:25:07,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 95.91666666666667) internal successors, (1151), 12 states have internal predecessors, (1151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:25:07,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:25:07,556 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:25:07,556 INFO L186 Difference]: Start difference. First operand has 126 places, 135 transitions, 490 flow. Second operand 12 states and 1151 transitions. [2022-01-19 10:25:07,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 298 transitions, 1752 flow [2022-01-19 10:25:07,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 298 transitions, 1752 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 10:25:07,573 INFO L242 Difference]: Finished difference. Result has 147 places, 166 transitions, 854 flow [2022-01-19 10:25:07,573 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=854, PETRI_PLACES=147, PETRI_TRANSITIONS=166} [2022-01-19 10:25:07,574 INFO L334 CegarLoopForPetriNet]: 107 programPoint places, 40 predicate places. [2022-01-19 10:25:07,574 INFO L470 AbstractCegarLoop]: Abstraction has has 147 places, 166 transitions, 854 flow [2022-01-19 10:25:07,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:25:07,574 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:25:07,574 INFO L254 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-01-19 10:25:07,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 10:25:07,574 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2022-01-19 10:25:07,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:25:07,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1097766141, now seen corresponding path program 1 times [2022-01-19 10:25:07,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:25:07,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310760766] [2022-01-19 10:25:07,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:25:07,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:25:07,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:25:07,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:25:07,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:25:07,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310760766] [2022-01-19 10:25:07,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310760766] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:25:07,610 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:25:07,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 10:25:07,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45551162] [2022-01-19 10:25:07,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:25:07,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 10:25:07,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:25:07,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 10:25:07,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 10:25:07,611 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114 [2022-01-19 10:25:07,612 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 166 transitions, 854 flow. Second operand has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:25:07,612 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:25:07,612 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114 [2022-01-19 10:25:07,612 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:25:08,126 INFO L129 PetriNetUnfolder]: 1449/4168 cut-off events. [2022-01-19 10:25:08,126 INFO L130 PetriNetUnfolder]: For 6626/6658 co-relation queries the response was YES. [2022-01-19 10:25:08,142 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12728 conditions, 4168 events. 1449/4168 cut-off events. For 6626/6658 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 40921 event pairs, 324 based on Foata normal form. 64/4184 useless extension candidates. Maximal degree in co-relation 12079. Up to 772 conditions per place. [2022-01-19 10:25:08,154 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 121 selfloop transitions, 59 changer transitions 15/267 dead transitions. [2022-01-19 10:25:08,155 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 267 transitions, 1822 flow [2022-01-19 10:25:08,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 10:25:08,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 10:25:08,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1213 transitions. [2022-01-19 10:25:08,157 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8184885290148448 [2022-01-19 10:25:08,157 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1213 transitions. [2022-01-19 10:25:08,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1213 transitions. [2022-01-19 10:25:08,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:25:08,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1213 transitions. [2022-01-19 10:25:08,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 93.3076923076923) internal successors, (1213), 13 states have internal predecessors, (1213), 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-01-19 10:25:08,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:25:08,163 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:25:08,163 INFO L186 Difference]: Start difference. First operand has 147 places, 166 transitions, 854 flow. Second operand 13 states and 1213 transitions. [2022-01-19 10:25:08,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 267 transitions, 1822 flow [2022-01-19 10:25:08,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 267 transitions, 1784 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-01-19 10:25:08,204 INFO L242 Difference]: Finished difference. Result has 161 places, 187 transitions, 1148 flow [2022-01-19 10:25:08,204 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1148, PETRI_PLACES=161, PETRI_TRANSITIONS=187} [2022-01-19 10:25:08,205 INFO L334 CegarLoopForPetriNet]: 107 programPoint places, 54 predicate places. [2022-01-19 10:25:08,205 INFO L470 AbstractCegarLoop]: Abstraction has has 161 places, 187 transitions, 1148 flow [2022-01-19 10:25:08,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:25:08,205 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:25:08,205 INFO L254 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-01-19 10:25:08,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 10:25:08,206 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2022-01-19 10:25:08,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:25:08,206 INFO L85 PathProgramCache]: Analyzing trace with hash 986673511, now seen corresponding path program 1 times [2022-01-19 10:25:08,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:25:08,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262152823] [2022-01-19 10:25:08,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:25:08,206 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:25:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:25:08,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:25:08,242 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:25:08,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262152823] [2022-01-19 10:25:08,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262152823] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:25:08,242 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:25:08,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 10:25:08,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482785712] [2022-01-19 10:25:08,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:25:08,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 10:25:08,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:25:08,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 10:25:08,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 10:25:08,243 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114 [2022-01-19 10:25:08,244 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 187 transitions, 1148 flow. Second operand has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:25:08,244 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:25:08,244 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114 [2022-01-19 10:25:08,244 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:25:08,762 INFO L129 PetriNetUnfolder]: 1575/4455 cut-off events. [2022-01-19 10:25:08,763 INFO L130 PetriNetUnfolder]: For 8680/8716 co-relation queries the response was YES. [2022-01-19 10:25:08,775 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14434 conditions, 4455 events. 1575/4455 cut-off events. For 8680/8716 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 43982 event pairs, 399 based on Foata normal form. 77/4467 useless extension candidates. Maximal degree in co-relation 13860. Up to 982 conditions per place. [2022-01-19 10:25:08,782 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 129 selfloop transitions, 63 changer transitions 27/295 dead transitions. [2022-01-19 10:25:08,782 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 295 transitions, 2213 flow [2022-01-19 10:25:08,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 10:25:08,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 10:25:08,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1218 transitions. [2022-01-19 10:25:08,784 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8218623481781376 [2022-01-19 10:25:08,784 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1218 transitions. [2022-01-19 10:25:08,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1218 transitions. [2022-01-19 10:25:08,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:25:08,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1218 transitions. [2022-01-19 10:25:08,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 93.6923076923077) internal successors, (1218), 13 states have internal predecessors, (1218), 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-01-19 10:25:08,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:25:08,788 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:25:08,788 INFO L186 Difference]: Start difference. First operand has 161 places, 187 transitions, 1148 flow. Second operand 13 states and 1218 transitions. [2022-01-19 10:25:08,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 295 transitions, 2213 flow [2022-01-19 10:25:08,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 295 transitions, 2171 flow, removed 10 selfloop flow, removed 2 redundant places. [2022-01-19 10:25:08,820 INFO L242 Difference]: Finished difference. Result has 175 places, 206 transitions, 1443 flow [2022-01-19 10:25:08,820 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1113, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1443, PETRI_PLACES=175, PETRI_TRANSITIONS=206} [2022-01-19 10:25:08,820 INFO L334 CegarLoopForPetriNet]: 107 programPoint places, 68 predicate places. [2022-01-19 10:25:08,821 INFO L470 AbstractCegarLoop]: Abstraction has has 175 places, 206 transitions, 1443 flow [2022-01-19 10:25:08,821 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:25:08,821 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:25:08,821 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 10:25:08,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 10:25:08,821 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2022-01-19 10:25:08,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:25:08,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1800096226, now seen corresponding path program 1 times [2022-01-19 10:25:08,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:25:08,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250298879] [2022-01-19 10:25:08,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:25:08,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:25:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:25:08,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:25:08,877 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:25:08,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250298879] [2022-01-19 10:25:08,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250298879] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:25:08,877 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:25:08,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 10:25:08,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373796117] [2022-01-19 10:25:08,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:25:08,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 10:25:08,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:25:08,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 10:25:08,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-19 10:25:08,878 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2022-01-19 10:25:08,879 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 206 transitions, 1443 flow. Second operand has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 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-01-19 10:25:08,879 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:25:08,879 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2022-01-19 10:25:08,879 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:25:09,194 INFO L129 PetriNetUnfolder]: 673/2900 cut-off events. [2022-01-19 10:25:09,195 INFO L130 PetriNetUnfolder]: For 6525/6611 co-relation queries the response was YES. [2022-01-19 10:25:09,206 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9235 conditions, 2900 events. 673/2900 cut-off events. For 6525/6611 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 29294 event pairs, 50 based on Foata normal form. 83/2962 useless extension candidates. Maximal degree in co-relation 8794. Up to 290 conditions per place. [2022-01-19 10:25:09,210 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 57 selfloop transitions, 17 changer transitions 34/254 dead transitions. [2022-01-19 10:25:09,210 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 254 transitions, 1836 flow [2022-01-19 10:25:09,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 10:25:09,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 10:25:09,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1062 transitions. [2022-01-19 10:25:09,212 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.84688995215311 [2022-01-19 10:25:09,212 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1062 transitions. [2022-01-19 10:25:09,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1062 transitions. [2022-01-19 10:25:09,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:25:09,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1062 transitions. [2022-01-19 10:25:09,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 96.54545454545455) internal successors, (1062), 11 states have internal predecessors, (1062), 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-01-19 10:25:09,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 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-01-19 10:25:09,216 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 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-01-19 10:25:09,216 INFO L186 Difference]: Start difference. First operand has 175 places, 206 transitions, 1443 flow. Second operand 11 states and 1062 transitions. [2022-01-19 10:25:09,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 254 transitions, 1836 flow [2022-01-19 10:25:09,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 254 transitions, 1754 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-01-19 10:25:09,248 INFO L242 Difference]: Finished difference. Result has 182 places, 191 transitions, 1257 flow [2022-01-19 10:25:09,248 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1230, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1257, PETRI_PLACES=182, PETRI_TRANSITIONS=191} [2022-01-19 10:25:09,248 INFO L334 CegarLoopForPetriNet]: 107 programPoint places, 75 predicate places. [2022-01-19 10:25:09,249 INFO L470 AbstractCegarLoop]: Abstraction has has 182 places, 191 transitions, 1257 flow [2022-01-19 10:25:09,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 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-01-19 10:25:09,249 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:25:09,249 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 10:25:09,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 10:25:09,249 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2022-01-19 10:25:09,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:25:09,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1208605840, now seen corresponding path program 2 times [2022-01-19 10:25:09,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:25:09,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398484834] [2022-01-19 10:25:09,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:25:09,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:25:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:25:09,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:25:09,299 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:25:09,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398484834] [2022-01-19 10:25:09,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398484834] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:25:09,300 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:25:09,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 10:25:09,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677842717] [2022-01-19 10:25:09,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:25:09,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 10:25:09,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:25:09,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 10:25:09,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-19 10:25:09,301 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2022-01-19 10:25:09,301 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 191 transitions, 1257 flow. Second operand has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 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-01-19 10:25:09,301 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:25:09,301 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2022-01-19 10:25:09,301 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:25:09,564 INFO L129 PetriNetUnfolder]: 545/2342 cut-off events. [2022-01-19 10:25:09,565 INFO L130 PetriNetUnfolder]: For 5675/5734 co-relation queries the response was YES. [2022-01-19 10:25:09,573 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8191 conditions, 2342 events. 545/2342 cut-off events. For 5675/5734 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 22784 event pairs, 67 based on Foata normal form. 19/2346 useless extension candidates. Maximal degree in co-relation 8125. Up to 303 conditions per place. [2022-01-19 10:25:09,576 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 55 selfloop transitions, 21 changer transitions 13/235 dead transitions. [2022-01-19 10:25:09,576 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 235 transitions, 1665 flow [2022-01-19 10:25:09,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 10:25:09,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 10:25:09,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 873 transitions. [2022-01-19 10:25:09,578 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8508771929824561 [2022-01-19 10:25:09,578 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 873 transitions. [2022-01-19 10:25:09,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 873 transitions. [2022-01-19 10:25:09,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:25:09,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 873 transitions. [2022-01-19 10:25:09,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.0) internal successors, (873), 9 states have internal predecessors, (873), 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-01-19 10:25:09,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:25:09,581 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:25:09,581 INFO L186 Difference]: Start difference. First operand has 182 places, 191 transitions, 1257 flow. Second operand 9 states and 873 transitions. [2022-01-19 10:25:09,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 235 transitions, 1665 flow [2022-01-19 10:25:09,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 235 transitions, 1557 flow, removed 20 selfloop flow, removed 8 redundant places. [2022-01-19 10:25:09,601 INFO L242 Difference]: Finished difference. Result has 176 places, 195 transitions, 1235 flow [2022-01-19 10:25:09,601 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=1184, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1235, PETRI_PLACES=176, PETRI_TRANSITIONS=195} [2022-01-19 10:25:09,601 INFO L334 CegarLoopForPetriNet]: 107 programPoint places, 69 predicate places. [2022-01-19 10:25:09,602 INFO L470 AbstractCegarLoop]: Abstraction has has 176 places, 195 transitions, 1235 flow [2022-01-19 10:25:09,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 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-01-19 10:25:09,602 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:25:09,602 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 10:25:09,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 10:25:09,602 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2022-01-19 10:25:09,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:25:09,602 INFO L85 PathProgramCache]: Analyzing trace with hash -110724310, now seen corresponding path program 3 times [2022-01-19 10:25:09,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:25:09,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404795988] [2022-01-19 10:25:09,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:25:09,603 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:25:09,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 10:25:09,613 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 10:25:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 10:25:09,636 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 10:25:09,637 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 10:25:09,637 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-01-19 10:25:09,638 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-01-19 10:25:09,638 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2022-01-19 10:25:09,638 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2022-01-19 10:25:09,638 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2022-01-19 10:25:09,638 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2022-01-19 10:25:09,639 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-01-19 10:25:09,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 10:25:09,641 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2022-01-19 10:25:09,644 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 10:25:09,644 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 10:25:09,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 10:25:09 BasicIcfg [2022-01-19 10:25:09,676 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 10:25:09,677 INFO L158 Benchmark]: Toolchain (without parser) took 5351.19ms. Allocated memory was 329.3MB in the beginning and 673.2MB in the end (delta: 343.9MB). Free memory was 272.3MB in the beginning and 498.2MB in the end (delta: -225.8MB). Peak memory consumption was 119.0MB. Max. memory is 16.0GB. [2022-01-19 10:25:09,677 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 329.3MB. Free memory is still 289.8MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 10:25:09,677 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.11ms. Allocated memory was 329.3MB in the beginning and 396.4MB in the end (delta: 67.1MB). Free memory was 272.2MB in the beginning and 359.3MB in the end (delta: -87.0MB). Peak memory consumption was 9.0MB. Max. memory is 16.0GB. [2022-01-19 10:25:09,678 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.84ms. Allocated memory is still 396.4MB. Free memory was 359.3MB in the beginning and 357.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 10:25:09,678 INFO L158 Benchmark]: Boogie Preprocessor took 14.11ms. Allocated memory is still 396.4MB. Free memory was 357.2MB in the beginning and 356.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 10:25:09,678 INFO L158 Benchmark]: RCFGBuilder took 366.39ms. Allocated memory is still 396.4MB. Free memory was 356.1MB in the beginning and 339.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2022-01-19 10:25:09,678 INFO L158 Benchmark]: TraceAbstraction took 4632.61ms. Allocated memory was 396.4MB in the beginning and 673.2MB in the end (delta: 276.8MB). Free memory was 339.3MB in the beginning and 498.2MB in the end (delta: -158.8MB). Peak memory consumption was 116.9MB. Max. memory is 16.0GB. [2022-01-19 10:25:09,679 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.09ms. Allocated memory is still 329.3MB. Free memory is still 289.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 299.11ms. Allocated memory was 329.3MB in the beginning and 396.4MB in the end (delta: 67.1MB). Free memory was 272.2MB in the beginning and 359.3MB in the end (delta: -87.0MB). Peak memory consumption was 9.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 30.84ms. Allocated memory is still 396.4MB. Free memory was 359.3MB in the beginning and 357.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 14.11ms. Allocated memory is still 396.4MB. Free memory was 357.2MB in the beginning and 356.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 366.39ms. Allocated memory is still 396.4MB. Free memory was 356.1MB in the beginning and 339.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 4632.61ms. Allocated memory was 396.4MB in the beginning and 673.2MB in the end (delta: 276.8MB). Free memory was 339.3MB in the beginning and 498.2MB in the end (delta: -158.8MB). Peak memory consumption was 116.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 738]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L704] 0 int w=0, r=0, x, y; VAL [r=0, w=0, x=0, y=0] [L748] 0 pthread_t t1, t2, t3, t4; VAL [r=0, t1={6:0}, t2={7:0}, t3={8:0}, t4={5:0}, w=0, x=0, y=0] [L749] FCALL, FORK 0 pthread_create(&t1, 0, writer, 0) VAL [pthread_create(&t1, 0, writer, 0)=-3, r=0, t1={6:0}, t2={7:0}, t3={8:0}, t4={5:0}, w=0, x=0, y=0] [L750] FCALL, FORK 0 pthread_create(&t2, 0, reader, 0) VAL [pthread_create(&t2, 0, reader, 0)=-2, r=0, t1={6:0}, t2={7:0}, t3={8:0}, t4={5:0}, w=0, x=0, y=0] [L751] FCALL, FORK 0 pthread_create(&t3, 0, writer, 0) VAL [pthread_create(&t3, 0, writer, 0)=-1, r=0, t1={6:0}, t2={7:0}, t3={8:0}, t4={5:0}, w=0, x=0, y=0] [L752] FCALL, FORK 0 pthread_create(&t4, 0, reader, 0) VAL [pthread_create(&t4, 0, reader, 0)=0, r=0, t1={6:0}, t2={7:0}, t3={8:0}, t4={5:0}, w=0, x=0, y=0] [L724] 2 int l; VAL [arg={0:0}, arg={0:0}, r=0, w=0, x=0, y=0] [L725] CALL 2 __VERIFIER_atomic_take_read_lock() [L710] CALL 2 assume_abort_if_not(w==0) [L3] COND FALSE 2 !(!cond) [L710] RET 2 assume_abort_if_not(w==0) [L711] 2 r = r+1 [L725] RET 2 __VERIFIER_atomic_take_read_lock() [L727] 2 l = x VAL [arg={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L730] 2 y = l VAL [arg={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L733] 2 int ly = y; VAL [arg={0:0}, arg={0:0}, l=0, ly=0, r=1, w=0, x=0, y=0] [L736] 2 int lx = x; VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L738] COND FALSE 2 !(!(ly == lx)) VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L740] 2 l = r-1 VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L724] 4 int l; VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L725] CALL 4 __VERIFIER_atomic_take_read_lock() [L710] CALL 4 assume_abort_if_not(w==0) [L3] COND FALSE 4 !(!cond) [L710] RET 4 assume_abort_if_not(w==0) [L711] 4 r = r+1 [L725] RET 4 __VERIFIER_atomic_take_read_lock() [L727] 4 l = x VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=2, w=0, x=0, y=0] [L730] 4 y = l VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=2, w=0, x=0, y=0] [L733] 4 int ly = y; VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=2, w=0, x=0, y=0] [L743] 2 r = l VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=0, x=0, y=0] [L714] CALL 1 __VERIFIER_atomic_take_write_lock() [L706] CALL 1 assume_abort_if_not(w==0 && r==0) [L3] COND FALSE 1 !(!cond) [L706] RET 1 assume_abort_if_not(w==0 && r==0) [L707] 1 w = 1 [L714] RET 1 __VERIFIER_atomic_take_write_lock() [L716] 1 x = 3 VAL [arg={0:0}, arg={0:0}, r=0, w=1, x=3, y=0] [L736] 4 int lx = x; VAL [arg={0:0}, arg={0:0}, l=0, lx=3, ly=0, r=0, w=1, x=3, y=0] [L738] COND TRUE 4 !(ly == lx) VAL [arg={0:0}, arg={0:0}, l=0, lx=3, ly=0, r=0, w=1, x=3, y=0] [L738] 4 reach_error() VAL [arg={0:0}, arg={0:0}, l=0, lx=3, ly=0, r=0, w=1, x=3, y=0] - UnprovableResult [Line: 749]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 750]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 751]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 139 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 566 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 566 mSDsluCounter, 413 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 818 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1488 IncrementalHoareTripleChecker+Invalid, 1540 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 166 mSDtfsCounter, 1488 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1443occurred in iteration=6, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 478 NumberOfCodeBlocks, 478 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 406 ConstructedInterpolants, 0 QuantifiedInterpolants, 734 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 RESULT: Ultimate proved your program to be incorrect! [2022-01-19 10:25:09,703 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...