/usr/bin/java -Xmx8000000000 -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-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 06:05:17,753 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 06:05:17,755 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 06:05:17,795 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 06:05:17,797 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 06:05:17,800 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 06:05:17,803 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 06:05:17,806 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 06:05:17,810 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 06:05:17,816 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 06:05:17,817 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 06:05:17,819 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 06:05:17,819 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 06:05:17,820 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 06:05:17,821 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 06:05:17,822 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 06:05:17,822 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 06:05:17,823 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 06:05:17,824 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 06:05:17,826 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 06:05:17,827 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 06:05:17,828 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 06:05:17,829 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 06:05:17,829 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 06:05:17,832 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 06:05:17,832 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 06:05:17,833 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 06:05:17,833 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 06:05:17,834 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 06:05:17,834 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 06:05:17,834 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 06:05:17,835 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 06:05:17,836 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 06:05:17,836 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 06:05:17,837 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 06:05:17,837 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 06:05:17,838 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 06:05:17,838 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 06:05:17,838 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 06:05:17,839 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 06:05:17,840 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 06:05:17,840 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-RepeatedSemanticLbe.epf [2022-12-13 06:05:17,859 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 06:05:17,860 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 06:05:17,861 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 06:05:17,861 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 06:05:17,861 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 06:05:17,861 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 06:05:17,861 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 06:05:17,862 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 06:05:17,862 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 06:05:17,862 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 06:05:17,862 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 06:05:17,862 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 06:05:17,862 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 06:05:17,862 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 06:05:17,863 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 06:05:17,863 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 06:05:17,863 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 06:05:17,863 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 06:05:17,863 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 06:05:17,863 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 06:05:17,864 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 06:05:17,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 06:05:17,864 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 06:05:17,864 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 06:05:17,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 06:05:17,864 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 06:05:17,864 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 06:05:17,865 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 06:05:17,865 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-13 06:05:18,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 06:05:18,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 06:05:18,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 06:05:18,178 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 06:05:18,180 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 06:05:18,181 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-12-13 06:05:19,481 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 06:05:19,849 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 06:05:19,850 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i [2022-12-13 06:05:19,862 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca7d3b449/364133bb481b42eda76793d708e341e1/FLAG08d65bb28 [2022-12-13 06:05:19,883 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca7d3b449/364133bb481b42eda76793d708e341e1 [2022-12-13 06:05:19,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 06:05:19,887 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 06:05:19,887 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 06:05:19,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 06:05:19,890 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 06:05:19,890 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:05:19" (1/1) ... [2022-12-13 06:05:19,891 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1263b3ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:05:19, skipping insertion in model container [2022-12-13 06:05:19,891 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:05:19" (1/1) ... [2022-12-13 06:05:19,896 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 06:05:19,951 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 06:05:20,156 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-13 06:05:20,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:05:20,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:05:20,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:05:20,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:05:20,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:05:20,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:05:20,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:05:20,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:05:20,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:05:20,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:05:20,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:05:20,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:05:20,328 WARN L237 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-12-13 06:05:20,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:05:20,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:05:20,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:05:20,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:05:20,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 06:05:20,353 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 06:05:20,378 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-13 06:05:20,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:05:20,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:05:20,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:05:20,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:05:20,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:05:20,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:05:20,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:05:20,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:05:20,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:05:20,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:05:20,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:05:20,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:05:20,404 WARN L237 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-12-13 06:05:20,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:05:20,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:05:20,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:05:20,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:05:20,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 06:05:20,452 INFO L208 MainTranslator]: Completed translation [2022-12-13 06:05:20,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:05:20 WrapperNode [2022-12-13 06:05:20,453 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 06:05:20,454 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 06:05:20,454 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 06:05:20,455 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 06:05:20,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:05:20" (1/1) ... [2022-12-13 06:05:20,490 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:05:20" (1/1) ... [2022-12-13 06:05:20,517 INFO L138 Inliner]: procedures = 174, calls = 51, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 119 [2022-12-13 06:05:20,517 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 06:05:20,519 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 06:05:20,519 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 06:05:20,519 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 06:05:20,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:05:20" (1/1) ... [2022-12-13 06:05:20,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:05:20" (1/1) ... [2022-12-13 06:05:20,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:05:20" (1/1) ... [2022-12-13 06:05:20,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:05:20" (1/1) ... [2022-12-13 06:05:20,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:05:20" (1/1) ... [2022-12-13 06:05:20,565 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:05:20" (1/1) ... [2022-12-13 06:05:20,566 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:05:20" (1/1) ... [2022-12-13 06:05:20,567 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:05:20" (1/1) ... [2022-12-13 06:05:20,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 06:05:20,570 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 06:05:20,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 06:05:20,570 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 06:05:20,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:05:20" (1/1) ... [2022-12-13 06:05:20,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 06:05:20,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 06:05:20,665 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-12-13 06:05:20,739 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-12-13 06:05:20,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 06:05:20,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 06:05:20,776 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 06:05:20,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 06:05:20,776 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2022-12-13 06:05:20,776 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2022-12-13 06:05:20,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 06:05:20,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 06:05:20,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 06:05:20,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 06:05:20,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 06:05:20,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 06:05:20,778 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2022-12-13 06:05:20,778 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2022-12-13 06:05:20,779 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 06:05:20,964 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 06:05:20,965 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 06:05:21,331 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 06:05:21,400 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 06:05:21,401 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 06:05:21,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:05:21 BoogieIcfgContainer [2022-12-13 06:05:21,403 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 06:05:21,405 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 06:05:21,406 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 06:05:21,410 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 06:05:21,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:05:19" (1/3) ... [2022-12-13 06:05:21,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78f89b40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:05:21, skipping insertion in model container [2022-12-13 06:05:21,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:05:20" (2/3) ... [2022-12-13 06:05:21,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78f89b40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:05:21, skipping insertion in model container [2022-12-13 06:05:21,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:05:21" (3/3) ... [2022-12-13 06:05:21,413 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2022-12-13 06:05:21,430 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 06:05:21,430 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 06:05:21,430 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 06:05:21,552 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-13 06:05:21,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 110 transitions, 252 flow [2022-12-13 06:05:21,644 INFO L130 PetriNetUnfolder]: 2/106 cut-off events. [2022-12-13 06:05:21,645 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 06:05:21,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 106 events. 2/106 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 96 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-13 06:05:21,650 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 110 transitions, 252 flow [2022-12-13 06:05:21,654 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 93 transitions, 207 flow [2022-12-13 06:05:21,656 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:05:21,670 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 93 transitions, 207 flow [2022-12-13 06:05:21,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 93 transitions, 207 flow [2022-12-13 06:05:21,700 INFO L130 PetriNetUnfolder]: 2/93 cut-off events. [2022-12-13 06:05:21,700 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 06:05:21,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 93 events. 2/93 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 96 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-13 06:05:21,708 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 93 transitions, 207 flow [2022-12-13 06:05:21,709 INFO L226 LiptonReduction]: Number of co-enabled transitions 2574 [2022-12-13 06:05:25,748 INFO L241 LiptonReduction]: Total number of compositions: 67 [2022-12-13 06:05:25,769 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 06:05:25,776 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2c45f5e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 06:05:25,777 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 06:05:25,792 INFO L130 PetriNetUnfolder]: 1/38 cut-off events. [2022-12-13 06:05:25,792 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:05:25,792 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:05:25,793 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:05:25,794 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 06:05:25,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:05:25,799 INFO L85 PathProgramCache]: Analyzing trace with hash 2116681510, now seen corresponding path program 1 times [2022-12-13 06:05:25,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:05:25,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327472121] [2022-12-13 06:05:25,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:05:25,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:05:26,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:05:26,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:05:26,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:05:26,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327472121] [2022-12-13 06:05:26,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327472121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:05:26,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:05:26,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 06:05:26,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915652876] [2022-12-13 06:05:26,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:05:26,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 06:05:26,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:05:26,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 06:05:26,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 06:05:26,390 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 73 [2022-12-13 06:05:26,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 73 transitions, 167 flow. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-12-13 06:05:26,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:05:26,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 73 [2022-12-13 06:05:26,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:05:39,068 INFO L130 PetriNetUnfolder]: 111508/153289 cut-off events. [2022-12-13 06:05:39,069 INFO L131 PetriNetUnfolder]: For 7195/7195 co-relation queries the response was YES. [2022-12-13 06:05:39,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306352 conditions, 153289 events. 111508/153289 cut-off events. For 7195/7195 co-relation queries the response was YES. Maximal size of possible extension queue 4575. Compared 1038520 event pairs, 19188 based on Foata normal form. 0/97402 useless extension candidates. Maximal degree in co-relation 270767. Up to 69169 conditions per place. [2022-12-13 06:05:40,124 INFO L137 encePairwiseOnDemand]: 57/73 looper letters, 242 selfloop transitions, 28 changer transitions 29/312 dead transitions. [2022-12-13 06:05:40,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 312 transitions, 1312 flow [2022-12-13 06:05:40,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 06:05:40,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 06:05:40,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 450 transitions. [2022-12-13 06:05:40,165 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.684931506849315 [2022-12-13 06:05:40,170 INFO L295 CegarLoopForPetriNet]: 82 programPoint places, 7 predicate places. [2022-12-13 06:05:40,170 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 312 transitions, 1312 flow [2022-12-13 06:05:40,720 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 283 transitions, 1196 flow [2022-12-13 06:05:41,646 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:05:41,648 INFO L89 Accepts]: Start accepts. Operand has 89 places, 283 transitions, 1196 flow [2022-12-13 06:05:41,660 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:05:41,661 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:05:41,661 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 283 transitions, 1196 flow [2022-12-13 06:05:41,700 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 283 transitions, 1196 flow [2022-12-13 06:05:41,701 INFO L226 LiptonReduction]: Number of co-enabled transitions 3160 [2022-12-13 06:05:41,763 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:05:41,766 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 06:05:41,766 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 283 transitions, 1196 flow [2022-12-13 06:05:41,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-12-13 06:05:41,767 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:05:41,767 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:05:41,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 06:05:41,771 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 06:05:41,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:05:41,772 INFO L85 PathProgramCache]: Analyzing trace with hash 566570295, now seen corresponding path program 1 times [2022-12-13 06:05:41,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:05:41,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740200955] [2022-12-13 06:05:41,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:05:41,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:05:41,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:05:41,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:05:41,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:05:41,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740200955] [2022-12-13 06:05:41,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740200955] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:05:41,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:05:41,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:05:42,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683727295] [2022-12-13 06:05:42,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:05:42,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:05:42,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:05:42,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:05:42,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:05:42,002 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 68 [2022-12-13 06:05:42,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 283 transitions, 1196 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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-12-13 06:05:42,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:05:42,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 68 [2022-12-13 06:05:42,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:05:55,469 INFO L130 PetriNetUnfolder]: 120320/171583 cut-off events. [2022-12-13 06:05:55,470 INFO L131 PetriNetUnfolder]: For 38013/39376 co-relation queries the response was YES. [2022-12-13 06:05:55,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 466964 conditions, 171583 events. 120320/171583 cut-off events. For 38013/39376 co-relation queries the response was YES. Maximal size of possible extension queue 6088. Compared 1306223 event pairs, 13642 based on Foata normal form. 6301/129917 useless extension candidates. Maximal degree in co-relation 463389. Up to 80071 conditions per place. [2022-12-13 06:05:56,746 INFO L137 encePairwiseOnDemand]: 58/68 looper letters, 321 selfloop transitions, 46 changer transitions 0/435 dead transitions. [2022-12-13 06:05:56,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 435 transitions, 2616 flow [2022-12-13 06:05:56,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:05:56,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:05:56,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2022-12-13 06:05:56,749 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7254901960784313 [2022-12-13 06:05:56,750 INFO L295 CegarLoopForPetriNet]: 82 programPoint places, 9 predicate places. [2022-12-13 06:05:56,750 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 435 transitions, 2616 flow [2022-12-13 06:05:57,272 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 435 transitions, 2616 flow [2022-12-13 06:05:58,324 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:05:58,325 INFO L89 Accepts]: Start accepts. Operand has 91 places, 435 transitions, 2616 flow [2022-12-13 06:05:58,326 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:05:58,326 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:05:58,326 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 435 transitions, 2616 flow [2022-12-13 06:05:58,354 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 435 transitions, 2616 flow [2022-12-13 06:05:58,354 INFO L226 LiptonReduction]: Number of co-enabled transitions 3516 [2022-12-13 06:05:58,424 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:05:58,426 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 06:05:58,427 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 435 transitions, 2616 flow [2022-12-13 06:05:58,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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-12-13 06:05:58,427 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:05:58,427 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:05:58,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 06:05:58,427 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 06:05:58,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:05:58,428 INFO L85 PathProgramCache]: Analyzing trace with hash -281761369, now seen corresponding path program 2 times [2022-12-13 06:05:58,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:05:58,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911070124] [2022-12-13 06:05:58,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:05:58,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:05:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:05:58,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:05:58,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:05:58,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911070124] [2022-12-13 06:05:58,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911070124] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:05:58,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:05:58,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:05:58,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9830081] [2022-12-13 06:05:58,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:05:58,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:05:58,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:05:58,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:05:58,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:05:58,550 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 68 [2022-12-13 06:05:58,551 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 435 transitions, 2616 flow. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-12-13 06:05:58,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:05:58,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 68 [2022-12-13 06:05:58,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:06:06,001 INFO L130 PetriNetUnfolder]: 59063/96887 cut-off events. [2022-12-13 06:06:06,002 INFO L131 PetriNetUnfolder]: For 65390/65555 co-relation queries the response was YES. [2022-12-13 06:06:06,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 337509 conditions, 96887 events. 59063/96887 cut-off events. For 65390/65555 co-relation queries the response was YES. Maximal size of possible extension queue 5029. Compared 895291 event pairs, 3719 based on Foata normal form. 5748/76903 useless extension candidates. Maximal degree in co-relation 331551. Up to 54395 conditions per place. [2022-12-13 06:06:06,517 INFO L137 encePairwiseOnDemand]: 57/68 looper letters, 264 selfloop transitions, 39 changer transitions 176/543 dead transitions. [2022-12-13 06:06:06,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 543 transitions, 4263 flow [2022-12-13 06:06:06,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 06:06:06,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 06:06:06,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 207 transitions. [2022-12-13 06:06:06,519 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7610294117647058 [2022-12-13 06:06:06,520 INFO L295 CegarLoopForPetriNet]: 82 programPoint places, 12 predicate places. [2022-12-13 06:06:06,520 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 543 transitions, 4263 flow [2022-12-13 06:06:06,744 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 367 transitions, 2851 flow [2022-12-13 06:06:07,421 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:06:07,422 INFO L89 Accepts]: Start accepts. Operand has 87 places, 367 transitions, 2851 flow [2022-12-13 06:06:07,423 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:06:07,424 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:06:07,424 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 367 transitions, 2851 flow [2022-12-13 06:06:07,445 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 367 transitions, 2851 flow [2022-12-13 06:06:07,445 INFO L226 LiptonReduction]: Number of co-enabled transitions 2192 [2022-12-13 06:06:07,477 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:06:07,478 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-13 06:06:07,478 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 367 transitions, 2851 flow [2022-12-13 06:06:07,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-12-13 06:06:07,479 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:06:07,479 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:06:07,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 06:06:07,479 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 06:06:07,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:06:07,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1347845057, now seen corresponding path program 1 times [2022-12-13 06:06:07,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:06:07,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733711161] [2022-12-13 06:06:07,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:06:07,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:06:07,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:06:07,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:06:07,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:06:07,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733711161] [2022-12-13 06:06:07,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733711161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:06:07,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:06:07,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 06:06:07,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274136942] [2022-12-13 06:06:07,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:06:07,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 06:06:07,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:06:07,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 06:06:07,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 06:06:07,575 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 61 [2022-12-13 06:06:07,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 367 transitions, 2851 flow. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-12-13 06:06:07,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:06:07,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 61 [2022-12-13 06:06:07,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:06:13,755 INFO L130 PetriNetUnfolder]: 41706/73552 cut-off events. [2022-12-13 06:06:13,756 INFO L131 PetriNetUnfolder]: For 61219/61267 co-relation queries the response was YES. [2022-12-13 06:06:13,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 317322 conditions, 73552 events. 41706/73552 cut-off events. For 61219/61267 co-relation queries the response was YES. Maximal size of possible extension queue 4414. Compared 733860 event pairs, 1111 based on Foata normal form. 1958/60315 useless extension candidates. Maximal degree in co-relation 311795. Up to 37891 conditions per place. [2022-12-13 06:06:14,117 INFO L137 encePairwiseOnDemand]: 51/61 looper letters, 566 selfloop transitions, 55 changer transitions 129/764 dead transitions. [2022-12-13 06:06:14,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 764 transitions, 7557 flow [2022-12-13 06:06:14,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 06:06:14,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 06:06:14,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 342 transitions. [2022-12-13 06:06:14,119 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6229508196721312 [2022-12-13 06:06:14,119 INFO L295 CegarLoopForPetriNet]: 82 programPoint places, 12 predicate places. [2022-12-13 06:06:14,119 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 764 transitions, 7557 flow [2022-12-13 06:06:14,270 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 635 transitions, 6195 flow [2022-12-13 06:06:14,657 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:06:14,657 INFO L89 Accepts]: Start accepts. Operand has 91 places, 635 transitions, 6195 flow [2022-12-13 06:06:14,661 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:06:14,661 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:06:14,661 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 635 transitions, 6195 flow [2022-12-13 06:06:14,704 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 635 transitions, 6195 flow [2022-12-13 06:06:14,705 INFO L226 LiptonReduction]: Number of co-enabled transitions 3210 [2022-12-13 06:06:14,731 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:06:14,732 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-13 06:06:14,732 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 635 transitions, 6195 flow [2022-12-13 06:06:14,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-12-13 06:06:14,732 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:06:14,733 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:06:14,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 06:06:14,733 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 06:06:14,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:06:14,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1379497949, now seen corresponding path program 1 times [2022-12-13 06:06:14,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:06:14,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721831698] [2022-12-13 06:06:14,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:06:14,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:06:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:06:14,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-12-13 06:06:14,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:06:14,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721831698] [2022-12-13 06:06:14,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721831698] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:06:14,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:06:14,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 06:06:14,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953945845] [2022-12-13 06:06:14,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:06:14,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 06:06:14,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:06:14,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 06:06:14,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 06:06:14,810 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 57 [2022-12-13 06:06:14,811 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 635 transitions, 6195 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-12-13 06:06:14,811 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:06:14,811 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 57 [2022-12-13 06:06:14,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:06:21,271 INFO L130 PetriNetUnfolder]: 34777/62509 cut-off events. [2022-12-13 06:06:21,271 INFO L131 PetriNetUnfolder]: For 59344/59488 co-relation queries the response was YES. [2022-12-13 06:06:21,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326389 conditions, 62509 events. 34777/62509 cut-off events. For 59344/59488 co-relation queries the response was YES. Maximal size of possible extension queue 3866. Compared 630184 event pairs, 951 based on Foata normal form. 526/50708 useless extension candidates. Maximal degree in co-relation 324511. Up to 30973 conditions per place. [2022-12-13 06:06:21,617 INFO L137 encePairwiseOnDemand]: 47/57 looper letters, 619 selfloop transitions, 58 changer transitions 72/763 dead transitions. [2022-12-13 06:06:21,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 763 transitions, 8950 flow [2022-12-13 06:06:21,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 06:06:21,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 06:06:21,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 281 transitions. [2022-12-13 06:06:21,618 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5477582846003899 [2022-12-13 06:06:21,619 INFO L295 CegarLoopForPetriNet]: 82 programPoint places, 17 predicate places. [2022-12-13 06:06:21,619 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 763 transitions, 8950 flow [2022-12-13 06:06:21,778 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 691 transitions, 8097 flow [2022-12-13 06:06:22,157 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:06:22,158 INFO L89 Accepts]: Start accepts. Operand has 97 places, 691 transitions, 8097 flow [2022-12-13 06:06:22,161 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:06:22,161 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:06:22,162 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 691 transitions, 8097 flow [2022-12-13 06:06:22,199 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 691 transitions, 8097 flow [2022-12-13 06:06:22,200 INFO L226 LiptonReduction]: Number of co-enabled transitions 3386 [2022-12-13 06:06:22,215 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:06:22,216 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 59 [2022-12-13 06:06:22,216 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 691 transitions, 8097 flow [2022-12-13 06:06:22,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-12-13 06:06:22,216 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:06:22,216 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:06:22,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 06:06:22,216 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 06:06:22,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:06:22,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1364765330, now seen corresponding path program 1 times [2022-12-13 06:06:22,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:06:22,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374213136] [2022-12-13 06:06:22,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:06:22,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:06:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:06:22,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:06:22,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:06:22,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374213136] [2022-12-13 06:06:22,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374213136] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:06:22,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:06:22,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 06:06:22,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135935181] [2022-12-13 06:06:22,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:06:22,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 06:06:22,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:06:22,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 06:06:22,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 06:06:22,297 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 56 [2022-12-13 06:06:22,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 691 transitions, 8097 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-12-13 06:06:22,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:06:22,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 56 [2022-12-13 06:06:22,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:06:28,293 INFO L130 PetriNetUnfolder]: 31243/55587 cut-off events. [2022-12-13 06:06:28,293 INFO L131 PetriNetUnfolder]: For 61094/61334 co-relation queries the response was YES. [2022-12-13 06:06:28,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341544 conditions, 55587 events. 31243/55587 cut-off events. For 61094/61334 co-relation queries the response was YES. Maximal size of possible extension queue 3347. Compared 540089 event pairs, 791 based on Foata normal form. 586/45346 useless extension candidates. Maximal degree in co-relation 339404. Up to 28447 conditions per place. [2022-12-13 06:06:28,729 INFO L137 encePairwiseOnDemand]: 47/56 looper letters, 658 selfloop transitions, 59 changer transitions 40/771 dead transitions. [2022-12-13 06:06:28,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 771 transitions, 10569 flow [2022-12-13 06:06:28,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 06:06:28,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 06:06:28,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 243 transitions. [2022-12-13 06:06:28,730 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6198979591836735 [2022-12-13 06:06:28,731 INFO L295 CegarLoopForPetriNet]: 82 programPoint places, 21 predicate places. [2022-12-13 06:06:28,731 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 771 transitions, 10569 flow [2022-12-13 06:06:28,865 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 731 transitions, 10010 flow [2022-12-13 06:06:29,188 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:06:29,188 INFO L89 Accepts]: Start accepts. Operand has 100 places, 731 transitions, 10010 flow [2022-12-13 06:06:29,191 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:06:29,191 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:06:29,191 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 731 transitions, 10010 flow [2022-12-13 06:06:29,230 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 731 transitions, 10010 flow [2022-12-13 06:06:29,231 INFO L226 LiptonReduction]: Number of co-enabled transitions 3430 [2022-12-13 06:06:29,243 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:06:29,244 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-13 06:06:29,244 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 731 transitions, 10010 flow [2022-12-13 06:06:29,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-12-13 06:06:29,244 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:06:29,244 INFO L214 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] [2022-12-13 06:06:29,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 06:06:29,244 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 06:06:29,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:06:29,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1904697564, now seen corresponding path program 1 times [2022-12-13 06:06:29,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:06:29,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532778036] [2022-12-13 06:06:29,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:06:29,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:06:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:06:29,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:06:29,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:06:29,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532778036] [2022-12-13 06:06:29,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532778036] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:06:29,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:06:29,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 06:06:29,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277171217] [2022-12-13 06:06:29,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:06:29,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 06:06:29,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:06:29,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 06:06:29,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 06:06:29,346 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 54 [2022-12-13 06:06:29,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 731 transitions, 10010 flow. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 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-12-13 06:06:29,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:06:29,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 54 [2022-12-13 06:06:29,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:06:34,862 INFO L130 PetriNetUnfolder]: 29625/53123 cut-off events. [2022-12-13 06:06:34,862 INFO L131 PetriNetUnfolder]: For 89502/89502 co-relation queries the response was YES. [2022-12-13 06:06:35,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363531 conditions, 53123 events. 29625/53123 cut-off events. For 89502/89502 co-relation queries the response was YES. Maximal size of possible extension queue 3293. Compared 519428 event pairs, 719 based on Foata normal form. 1040/43526 useless extension candidates. Maximal degree in co-relation 361259. Up to 26569 conditions per place. [2022-12-13 06:06:35,167 INFO L137 encePairwiseOnDemand]: 42/54 looper letters, 510 selfloop transitions, 79 changer transitions 118/801 dead transitions. [2022-12-13 06:06:35,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 801 transitions, 12391 flow [2022-12-13 06:06:35,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 06:06:35,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 06:06:35,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 219 transitions. [2022-12-13 06:06:35,170 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5793650793650794 [2022-12-13 06:06:35,171 INFO L295 CegarLoopForPetriNet]: 82 programPoint places, 24 predicate places. [2022-12-13 06:06:35,171 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 801 transitions, 12391 flow [2022-12-13 06:06:35,313 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 683 transitions, 10515 flow [2022-12-13 06:06:35,684 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:06:35,685 INFO L89 Accepts]: Start accepts. Operand has 103 places, 683 transitions, 10515 flow [2022-12-13 06:06:35,687 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:06:35,688 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:06:35,688 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 683 transitions, 10515 flow [2022-12-13 06:06:35,736 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 683 transitions, 10515 flow [2022-12-13 06:06:35,737 INFO L226 LiptonReduction]: Number of co-enabled transitions 3226 [2022-12-13 06:06:35,896 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:06:35,897 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 213 [2022-12-13 06:06:35,897 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 683 transitions, 10515 flow [2022-12-13 06:06:35,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 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-12-13 06:06:35,897 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:06:35,897 INFO L214 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] [2022-12-13 06:06:35,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 06:06:35,898 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 06:06:35,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:06:35,898 INFO L85 PathProgramCache]: Analyzing trace with hash -90850936, now seen corresponding path program 2 times [2022-12-13 06:06:35,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:06:35,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842510181] [2022-12-13 06:06:35,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:06:35,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:06:35,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:06:36,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:06:36,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:06:36,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842510181] [2022-12-13 06:06:36,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842510181] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:06:36,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:06:36,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 06:06:36,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661158257] [2022-12-13 06:06:36,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:06:36,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 06:06:36,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:06:36,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 06:06:36,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 06:06:36,033 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 54 [2022-12-13 06:06:36,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 683 transitions, 10515 flow. Second operand has 7 states, 7 states have (on average 18.285714285714285) internal successors, (128), 7 states have internal predecessors, (128), 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-12-13 06:06:36,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:06:36,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 54 [2022-12-13 06:06:36,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:06:41,016 INFO L130 PetriNetUnfolder]: 24932/44656 cut-off events. [2022-12-13 06:06:41,016 INFO L131 PetriNetUnfolder]: For 121063/122100 co-relation queries the response was YES. [2022-12-13 06:06:41,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336741 conditions, 44656 events. 24932/44656 cut-off events. For 121063/122100 co-relation queries the response was YES. Maximal size of possible extension queue 2681. Compared 424989 event pairs, 611 based on Foata normal form. 923/36882 useless extension candidates. Maximal degree in co-relation 334218. Up to 24838 conditions per place. [2022-12-13 06:06:41,256 INFO L137 encePairwiseOnDemand]: 36/54 looper letters, 485 selfloop transitions, 117 changer transitions 75/769 dead transitions. [2022-12-13 06:06:41,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 769 transitions, 13266 flow [2022-12-13 06:06:41,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 06:06:41,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 06:06:41,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 296 transitions. [2022-12-13 06:06:41,258 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5481481481481482 [2022-12-13 06:06:41,259 INFO L295 CegarLoopForPetriNet]: 82 programPoint places, 30 predicate places. [2022-12-13 06:06:41,259 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 769 transitions, 13266 flow [2022-12-13 06:06:41,387 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 694 transitions, 11865 flow [2022-12-13 06:06:41,691 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:06:41,691 INFO L89 Accepts]: Start accepts. Operand has 111 places, 694 transitions, 11865 flow [2022-12-13 06:06:41,694 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:06:41,694 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:06:41,694 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 694 transitions, 11865 flow [2022-12-13 06:06:41,744 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 694 transitions, 11865 flow [2022-12-13 06:06:41,745 INFO L226 LiptonReduction]: Number of co-enabled transitions 3252 [2022-12-13 06:06:41,816 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:06:41,817 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 06:06:41,817 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 694 transitions, 11865 flow [2022-12-13 06:06:41,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.285714285714285) internal successors, (128), 7 states have internal predecessors, (128), 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-12-13 06:06:41,817 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:06:41,817 INFO L214 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] [2022-12-13 06:06:41,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 06:06:41,817 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 06:06:41,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:06:41,818 INFO L85 PathProgramCache]: Analyzing trace with hash -367361326, now seen corresponding path program 3 times [2022-12-13 06:06:41,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:06:41,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876590471] [2022-12-13 06:06:41,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:06:41,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:06:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 06:06:41,844 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 06:06:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 06:06:41,891 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 06:06:41,891 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 06:06:41,892 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 06:06:41,893 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 06:06:41,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 06:06:41,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 06:06:41,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 06:06:41,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 06:06:41,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 06:06:41,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 06:06:41,898 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2022-12-13 06:06:41,905 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 06:06:41,905 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 06:06:41,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 06:06:41 BasicIcfg [2022-12-13 06:06:41,981 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 06:06:41,981 INFO L158 Benchmark]: Toolchain (without parser) took 82094.58ms. Allocated memory was 200.3MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 175.5MB in the beginning and 3.7GB in the end (delta: -3.5GB). Peak memory consumption was 4.3GB. Max. memory is 8.0GB. [2022-12-13 06:06:41,981 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 200.3MB. Free memory is still 176.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 06:06:41,981 INFO L158 Benchmark]: CACSL2BoogieTranslator took 565.53ms. Allocated memory is still 200.3MB. Free memory was 175.0MB in the beginning and 153.4MB in the end (delta: 21.6MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-12-13 06:06:41,982 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.17ms. Allocated memory is still 200.3MB. Free memory was 153.4MB in the beginning and 151.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 06:06:41,982 INFO L158 Benchmark]: Boogie Preprocessor took 50.72ms. Allocated memory is still 200.3MB. Free memory was 151.4MB in the beginning and 149.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 06:06:41,982 INFO L158 Benchmark]: RCFGBuilder took 833.33ms. Allocated memory is still 200.3MB. Free memory was 149.9MB in the beginning and 134.2MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-12-13 06:06:41,982 INFO L158 Benchmark]: TraceAbstraction took 80575.22ms. Allocated memory was 200.3MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 133.1MB in the beginning and 3.7GB in the end (delta: -3.5GB). Peak memory consumption was 4.2GB. Max. memory is 8.0GB. [2022-12-13 06:06:41,984 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.14ms. Allocated memory is still 200.3MB. Free memory is still 176.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 565.53ms. Allocated memory is still 200.3MB. Free memory was 175.0MB in the beginning and 153.4MB in the end (delta: 21.6MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.17ms. Allocated memory is still 200.3MB. Free memory was 153.4MB in the beginning and 151.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.72ms. Allocated memory is still 200.3MB. Free memory was 151.4MB in the beginning and 149.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 833.33ms. Allocated memory is still 200.3MB. Free memory was 149.9MB in the beginning and 134.2MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 80575.22ms. Allocated memory was 200.3MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 133.1MB in the beginning and 3.7GB in the end (delta: -3.5GB). Peak memory consumption was 4.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 104 PlacesBefore, 82 PlacesAfterwards, 93 TransitionsBefore, 73 TransitionsAfterwards, 2574 CoEnabledTransitionPairs, 5 FixpointIterations, 0 TrivialSequentialCompositions, 11 ConcurrentSequentialCompositions, 19 TrivialYvCompositions, 35 ConcurrentYvCompositions, 2 ChoiceCompositions, 67 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7687, independent: 7397, independent conditional: 7397, independent unconditional: 0, dependent: 290, dependent conditional: 290, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7687, independent: 7397, independent conditional: 0, independent unconditional: 7397, dependent: 290, dependent conditional: 0, dependent unconditional: 290, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7687, independent: 7397, independent conditional: 0, independent unconditional: 7397, dependent: 290, dependent conditional: 0, dependent unconditional: 290, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7687, independent: 7397, independent conditional: 0, independent unconditional: 7397, dependent: 290, dependent conditional: 0, dependent unconditional: 290, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2510, independent: 2456, independent conditional: 0, independent unconditional: 2456, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2510, independent: 2392, independent conditional: 0, independent unconditional: 2392, dependent: 118, dependent conditional: 0, dependent unconditional: 118, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 118, independent: 64, independent conditional: 0, independent unconditional: 64, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 150, independent: 73, independent conditional: 0, independent unconditional: 73, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7687, independent: 4941, independent conditional: 0, independent unconditional: 4941, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 2510, unknown conditional: 0, unknown unconditional: 2510] , Statistics on independence cache: Total cache size (in pairs): 5685, Positive cache size: 5631, Positive conditional cache size: 0, Positive unconditional cache size: 5631, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 89 PlacesBefore, 89 PlacesAfterwards, 283 TransitionsBefore, 283 TransitionsAfterwards, 3160 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 91 PlacesBefore, 91 PlacesAfterwards, 435 TransitionsBefore, 435 TransitionsAfterwards, 3516 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 87 PlacesBefore, 87 PlacesAfterwards, 367 TransitionsBefore, 367 TransitionsAfterwards, 2192 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 91 PlacesBefore, 91 PlacesAfterwards, 635 TransitionsBefore, 635 TransitionsAfterwards, 3210 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 97 PlacesBefore, 97 PlacesAfterwards, 691 TransitionsBefore, 691 TransitionsAfterwards, 3386 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 100 PlacesBefore, 100 PlacesAfterwards, 731 TransitionsBefore, 731 TransitionsAfterwards, 3430 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 103 PlacesBefore, 103 PlacesAfterwards, 683 TransitionsBefore, 683 TransitionsAfterwards, 3226 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 111 PlacesBefore, 111 PlacesAfterwards, 694 TransitionsBefore, 694 TransitionsAfterwards, 3252 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - 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; [L748] 0 pthread_t t1, t2, t3, t4; [L749] FCALL, FORK 0 pthread_create(&t1, 0, writer, 0) VAL [pthread_create(&t1, 0, writer, 0)=-3, r=0, t1={5:0}, t2={7:0}, t3={6:0}, t4={8: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={5:0}, t2={7:0}, t3={6:0}, t4={8: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={5:0}, t2={7:0}, t3={6:0}, t4={8: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={5:0}, t2={7:0}, t3={6:0}, t4={8:0}, w=0, x=0, y=0] [L724] 2 int l; [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)) [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; [L725] CALL 4 __VERIFIER_atomic_take_read_lock() [L710] CALL 4 assume_abort_if_not(w==0) [L3] COND FALSE 4 !(!cond) [L710] RET 4 assume_abort_if_not(w==0) [L711] 4 r = r+1 [L725] RET 4 __VERIFIER_atomic_take_read_lock() [L743] 2 r = l VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=0, x=0, y=0] [L714] CALL 1 __VERIFIER_atomic_take_write_lock() [L706] CALL 1 assume_abort_if_not(w==0 && r==0) [L3] COND FALSE 1 !(!cond) [L706] RET 1 assume_abort_if_not(w==0 && r==0) [L707] 1 w = 1 [L714] RET 1 __VERIFIER_atomic_take_write_lock() [L727] 4 l = x VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L730] 4 y = l VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L733] 4 int ly = y; VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L716] 1 x = 3 VAL [arg={0:0}, arg={0:0}, r=0, w=1, x=3, y=0] [L736] 4 int lx = x; [L738] COND TRUE 4 !(ly == lx) [L738] 4 reach_error() VAL [arg={0:0}, arg={0:0}, l=0, lx=0, 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: 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. - 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 135 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: 80.3s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 67.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 904 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 904 mSDsluCounter, 150 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 63 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2292 IncrementalHoareTripleChecker+Invalid, 2345 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 87 mSDtfsCounter, 2292 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11865occurred in iteration=8, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 142 NumberOfCodeBlocks, 142 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 226 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-12-13 06:06:42,016 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...